./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_24-sound_lock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/04-mutex_24-sound_lock.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 120b8e17ecc05129f7277c5998da40ba955c11083c7096c2093845469caad913 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:04,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:04,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:22:04,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:04,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:04,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:04,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:04,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:04,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:04,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:04,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:04,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:04,606 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:04,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:04,607 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:04,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:04,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:04,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:04,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:04,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:04,610 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 -> 120b8e17ecc05129f7277c5998da40ba955c11083c7096c2093845469caad913 [2025-01-09 21:22:04,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:04,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:04,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:04,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:04,792 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:04,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_24-sound_lock.i [2025-01-09 21:22:06,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93289f0cc/c6c4eacb33b54efe98b7f8feb90b6177/FLAGdefaec46f [2025-01-09 21:22:06,349 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:06,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_24-sound_lock.i [2025-01-09 21:22:06,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93289f0cc/c6c4eacb33b54efe98b7f8feb90b6177/FLAGdefaec46f [2025-01-09 21:22:06,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93289f0cc/c6c4eacb33b54efe98b7f8feb90b6177 [2025-01-09 21:22:06,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:06,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:06,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:06,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:06,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:06,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:06,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdf414e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06, skipping insertion in model container [2025-01-09 21:22:06,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:06,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:06,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:06,879 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:06,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:06,962 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:06,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06 WrapperNode [2025-01-09 21:22:06,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:06,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:06,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:06,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:06,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:06,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,002 INFO L138 Inliner]: procedures = 263, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2025-01-09 21:22:07,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:07,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:07,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:07,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:07,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:07,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:07,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:07,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:07,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (1/1) ... [2025-01-09 21:22:07,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:07,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:07,055 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-01-09 21:22:07,057 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-01-09 21:22:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:07,085 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:07,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:07,087 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:22:07,178 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:07,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:07,302 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:07,302 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:07,315 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:07,315 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:07,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:07 BoogieIcfgContainer [2025-01-09 21:22:07,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:07,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:07,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:07,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:07,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:06" (1/3) ... [2025-01-09 21:22:07,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d436cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:07, skipping insertion in model container [2025-01-09 21:22:07,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:06" (2/3) ... [2025-01-09 21:22:07,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d436cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:07, skipping insertion in model container [2025-01-09 21:22:07,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:07" (3/3) ... [2025-01-09 21:22:07,326 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_24-sound_lock.i [2025-01-09 21:22:07,336 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:07,337 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_24-sound_lock.i that has 2 procedures, 69 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-09 21:22:07,337 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:07,370 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:22:07,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 69 transitions, 145 flow [2025-01-09 21:22:07,428 INFO L124 PetriNetUnfolderBase]: 1/68 cut-off events. [2025-01-09 21:22:07,431 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:07,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 68 events. 1/68 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-01-09 21:22:07,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 69 transitions, 145 flow [2025-01-09 21:22:07,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 63 transitions, 129 flow [2025-01-09 21:22:07,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:07,450 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;@5e854c9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:07,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:22:07,459 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:07,460 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2025-01-09 21:22:07,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:07,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:07,461 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] [2025-01-09 21:22:07,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:07,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1417833236, now seen corresponding path program 1 times [2025-01-09 21:22:07,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957043825] [2025-01-09 21:22:07,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:07,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:22:07,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:22:07,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:07,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957043825] [2025-01-09 21:22:07,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957043825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:07,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:07,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816969738] [2025-01-09 21:22:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:07,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:07,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 69 [2025-01-09 21:22:07,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-01-09 21:22:07,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:07,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 69 [2025-01-09 21:22:07,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:07,791 INFO L124 PetriNetUnfolderBase]: 32/186 cut-off events. [2025-01-09 21:22:07,793 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:07,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 186 events. 32/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 688 event pairs, 13 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 232. Up to 44 conditions per place. [2025-01-09 21:22:07,796 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 17 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2025-01-09 21:22:07,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 195 flow [2025-01-09 21:22:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2025-01-09 21:22:07,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178743961352657 [2025-01-09 21:22:07,808 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 129 flow. Second operand 3 states and 190 transitions. [2025-01-09 21:22:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 195 flow [2025-01-09 21:22:07,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:07,816 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 180 flow [2025-01-09 21:22:07,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2025-01-09 21:22:07,821 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2025-01-09 21:22:07,823 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 180 flow [2025-01-09 21:22:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-01-09 21:22:07,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:07,823 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] [2025-01-09 21:22:07,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:07,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:07,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:07,825 INFO L85 PathProgramCache]: Analyzing trace with hash 684320151, now seen corresponding path program 1 times [2025-01-09 21:22:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399966093] [2025-01-09 21:22:07,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:07,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:22:07,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:22:07,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:07,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:07,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399966093] [2025-01-09 21:22:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399966093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626221575] [2025-01-09 21:22:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:07,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:07,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:07,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 69 [2025-01-09 21:22:07,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-01-09 21:22:07,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:07,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 69 [2025-01-09 21:22:07,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:07,974 INFO L124 PetriNetUnfolderBase]: 47/228 cut-off events. [2025-01-09 21:22:07,974 INFO L125 PetriNetUnfolderBase]: For 89/93 co-relation queries the response was YES. [2025-01-09 21:22:07,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 228 events. 47/228 cut-off events. For 89/93 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1004 event pairs, 21 based on Foata normal form. 3/214 useless extension candidates. Maximal degree in co-relation 393. Up to 86 conditions per place. [2025-01-09 21:22:07,980 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 16 selfloop transitions, 7 changer transitions 1/76 dead transitions. [2025-01-09 21:22:07,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 76 transitions, 252 flow [2025-01-09 21:22:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-01-09 21:22:07,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.893719806763285 [2025-01-09 21:22:07,981 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 180 flow. Second operand 3 states and 185 transitions. [2025-01-09 21:22:07,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 76 transitions, 252 flow [2025-01-09 21:22:07,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:07,985 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 224 flow [2025-01-09 21:22:07,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2025-01-09 21:22:07,986 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2025-01-09 21:22:07,986 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 224 flow [2025-01-09 21:22:07,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-01-09 21:22:07,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:07,988 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] [2025-01-09 21:22:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:22:07,989 INFO L396 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-01-09 21:22:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1852371214, now seen corresponding path program 1 times [2025-01-09 21:22:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351033705] [2025-01-09 21:22:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:08,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:22:08,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:22:08,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:08,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:08,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:08,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351033705] [2025-01-09 21:22:08,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351033705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:08,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:08,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:22:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329314297] [2025-01-09 21:22:08,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:08,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:08,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:08,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:08,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 69 [2025-01-09 21:22:08,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-01-09 21:22:08,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:08,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 69 [2025-01-09 21:22:08,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:08,138 INFO L124 PetriNetUnfolderBase]: 60/269 cut-off events. [2025-01-09 21:22:08,139 INFO L125 PetriNetUnfolderBase]: For 176/180 co-relation queries the response was YES. [2025-01-09 21:22:08,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 269 events. 60/269 cut-off events. For 176/180 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1229 event pairs, 21 based on Foata normal form. 1/253 useless extension candidates. Maximal degree in co-relation 541. Up to 100 conditions per place. [2025-01-09 21:22:08,141 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 16 selfloop transitions, 7 changer transitions 7/81 dead transitions. [2025-01-09 21:22:08,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 81 transitions, 308 flow [2025-01-09 21:22:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-01-09 21:22:08,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2025-01-09 21:22:08,144 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 224 flow. Second operand 3 states and 180 transitions. [2025-01-09 21:22:08,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 81 transitions, 308 flow [2025-01-09 21:22:08,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:08,149 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 242 flow [2025-01-09 21:22:08,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2025-01-09 21:22:08,150 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2025-01-09 21:22:08,150 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 242 flow [2025-01-09 21:22:08,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-01-09 21:22:08,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:08,150 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] [2025-01-09 21:22:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:08,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:08,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1112816022, now seen corresponding path program 1 times [2025-01-09 21:22:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491385738] [2025-01-09 21:22:08,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:08,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:08,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:22:08,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:22:08,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:08,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:22:08,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:08,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491385738] [2025-01-09 21:22:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491385738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:22:08,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069779855] [2025-01-09 21:22:08,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:08,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:22:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:08,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:22:08,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:22:08,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 69 [2025-01-09 21:22:08,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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-01-09 21:22:08,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:08,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 69 [2025-01-09 21:22:08,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:08,417 INFO L124 PetriNetUnfolderBase]: 22/261 cut-off events. [2025-01-09 21:22:08,418 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-01-09 21:22:08,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 261 events. 22/261 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1294 event pairs, 6 based on Foata normal form. 2/255 useless extension candidates. Maximal degree in co-relation 373. Up to 38 conditions per place. [2025-01-09 21:22:08,420 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 5 selfloop transitions, 5 changer transitions 8/81 dead transitions. [2025-01-09 21:22:08,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 81 transitions, 294 flow [2025-01-09 21:22:08,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:22:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:22:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 309 transitions. [2025-01-09 21:22:08,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2025-01-09 21:22:08,423 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 242 flow. Second operand 5 states and 309 transitions. [2025-01-09 21:22:08,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 81 transitions, 294 flow [2025-01-09 21:22:08,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 81 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:22:08,426 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 242 flow [2025-01-09 21:22:08,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2025-01-09 21:22:08,427 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2025-01-09 21:22:08,427 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 242 flow [2025-01-09 21:22:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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-01-09 21:22:08,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:08,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:22:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:22:08,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:08,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1734049911, now seen corresponding path program 1 times [2025-01-09 21:22:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215205486] [2025-01-09 21:22:08,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:08,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:22:08,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:22:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:08,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:08,452 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:22:08,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:22:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:22:08,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:08,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:22:08,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:22:08,478 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:22:08,478 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-01-09 21:22:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-01-09 21:22:08,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-01-09 21:22:08,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-01-09 21:22:08,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-01-09 21:22:08,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-01-09 21:22:08,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-01-09 21:22:08,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:08,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:22:08,514 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:22:08,514 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:22:08,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:22:08 BasicIcfg [2025-01-09 21:22:08,521 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:22:08,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:22:08,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:22:08,521 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:22:08,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:07" (3/4) ... [2025-01-09 21:22:08,523 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:22:08,563 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-01-09 21:22:08,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:22:08,592 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:22:08,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:22:08,592 INFO L158 Benchmark]: Toolchain (without parser) took 1975.91ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 87.9MB in the end (delta: 24.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-01-09 21:22:08,594 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:08,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.16ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 84.5MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:22:08,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.79ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:08,595 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:08,595 INFO L158 Benchmark]: RCFGBuilder took 291.02ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 67.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:22:08,595 INFO L158 Benchmark]: TraceAbstraction took 1203.61ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 95.1MB in the end (delta: -28.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:08,595 INFO L158 Benchmark]: Witness Printer took 70.83ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 87.9MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:22:08,596 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.12ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.16ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 84.5MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.79ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 291.02ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 67.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1203.61ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 95.1MB in the end (delta: -28.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.83ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 87.9MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 934]: Data race detected Data race detected The following path leads to a data race: [L918] 0 int myglobal; VAL [myglobal=0] [L919] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, myglobal=0] [L920] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, mutex2={2:0}, myglobal=0] [L928] 0 int i = __VERIFIER_nondet_int(); VAL [i=1, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L929] 0 pthread_t id; VAL [i=1, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L930] 0 pthread_mutex_t *m = &mutex1; VAL [i=1, m={1:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L931] COND TRUE 0 \read(i) VAL [i=1, m={1:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L931] 0 m = &mutex2 VAL [i=1, m={2:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L932] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id=-1, m={2:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L923] EXPR 1 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L934] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, id=-1, m={2:0}, mutex1={1:0}, mutex2={2:0}, myglobal=0] [L923] 1 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={1:0}, mutex2={2:0}, myglobal=1] [L934] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, id=-1, m={2:0}, mutex1={1:0}, mutex2={2:0}, myglobal=1] Now there is a data race on ~myglobal~0 between C: myglobal=myglobal+1 [923] and C: myglobal+1 [934] - UnprovableResult [Line: 934]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 932]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 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: 1.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 34 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 0.3s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 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-01-09 21:22:08,612 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)