./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_27-base_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_27-base_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 b91c0e76ead39d37c0c1e44d79e923c90b028e42d77a4818013a56c3d1542d8d --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:13,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:13,766 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:13,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:13,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:13,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:13,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:13,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:13,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:13,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:13,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:13,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:13,791 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:13,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:13,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:13,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:13,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:13,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:13,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:13,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:13,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:13,794 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 -> b91c0e76ead39d37c0c1e44d79e923c90b028e42d77a4818013a56c3d1542d8d [2025-04-30 10:26:14,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:14,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:14,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:14,072 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:14,072 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:14,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_27-base_rc.i [2025-04-30 10:26:15,434 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac54d2af/b0ff586bbbfc470f8a1a98c4b2ffd6b5/FLAG3eccf160e [2025-04-30 10:26:15,752 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:15,753 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_27-base_rc.i [2025-04-30 10:26:15,764 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac54d2af/b0ff586bbbfc470f8a1a98c4b2ffd6b5/FLAG3eccf160e [2025-04-30 10:26:16,484 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac54d2af/b0ff586bbbfc470f8a1a98c4b2ffd6b5 [2025-04-30 10:26:16,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:16,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:16,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:16,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:16,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:16,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:16" (1/1) ... [2025-04-30 10:26:16,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67dcd3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:16, skipping insertion in model container [2025-04-30 10:26:16,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:16" (1/1) ... [2025-04-30 10:26:16,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:16,819 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:16,839 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:16,902 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:16,941 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:16,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:16 WrapperNode [2025-04-30 10:26:16,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:16,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:16,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:16,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:16,947 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:16" (1/1) ... [2025-04-30 10:26:16,960 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:16" (1/1) ... [2025-04-30 10:26:16,979 INFO L138 Inliner]: procedures = 265, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 92 [2025-04-30 10:26:16,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:16,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:16,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:16,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:16,983 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:16" (1/1) ... [2025-04-30 10:26:16,983 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:16" (1/1) ... [2025-04-30 10:26:16,985 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:16" (1/1) ... [2025-04-30 10:26:16,985 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:16" (1/1) ... [2025-04-30 10:26:16,988 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:16" (1/1) ... [2025-04-30 10:26:16,988 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:16" (1/1) ... [2025-04-30 10:26:16,989 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:16" (1/1) ... [2025-04-30 10:26:16,990 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:16" (1/1) ... [2025-04-30 10:26:16,990 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:16" (1/1) ... [2025-04-30 10:26:16,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:16,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:16,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:16,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:16,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:16" (1/1) ... [2025-04-30 10:26:17,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:17,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:17,022 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:17,025 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:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:17,043 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:17,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:17,045 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:17,156 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:17,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:17,312 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:17,312 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:17,336 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:17,337 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:17,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:17 BoogieIcfgContainer [2025-04-30 10:26:17,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:17,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:17,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:17,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:17,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:16" (1/3) ... [2025-04-30 10:26:17,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8007bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:17, skipping insertion in model container [2025-04-30 10:26:17,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:16" (2/3) ... [2025-04-30 10:26:17,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8007bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:17, skipping insertion in model container [2025-04-30 10:26:17,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:17" (3/3) ... [2025-04-30 10:26:17,344 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_27-base_rc.i [2025-04-30 10:26:17,353 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:17,357 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_27-base_rc.i that has 2 procedures, 97 locations, 96 edges, 1 initial locations, 0 loop locations, and 7 error locations. [2025-04-30 10:26:17,357 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:17,413 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:17,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 97 transitions, 198 flow [2025-04-30 10:26:17,493 INFO L116 PetriNetUnfolderBase]: 1/96 cut-off events. [2025-04-30 10:26:17,495 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:17,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 96 events. 1/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2025-04-30 10:26:17,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 97 transitions, 198 flow [2025-04-30 10:26:17,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 96 transitions, 195 flow [2025-04-30 10:26:17,511 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:17,520 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;@59f678a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:17,522 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:26:17,532 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:17,533 INFO L116 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-04-30 10:26:17,533 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:17,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:17,534 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] [2025-04-30 10:26:17,534 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:17,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:17,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1470809619, now seen corresponding path program 1 times [2025-04-30 10:26:17,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:17,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68658783] [2025-04-30 10:26:17,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:17,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:26:17,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:26:17,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:17,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:17,741 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:17,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:17,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68658783] [2025-04-30 10:26:17,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68658783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:17,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:17,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622658906] [2025-04-30 10:26:17,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:17,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:17,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:17,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:17,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 97 [2025-04-30 10:26:17,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:17,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:17,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 97 [2025-04-30 10:26:17,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:17,914 INFO L116 PetriNetUnfolderBase]: 50/466 cut-off events. [2025-04-30 10:26:17,915 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:17,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 466 events. 50/466 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2763 event pairs, 8 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 550. Up to 57 conditions per place. [2025-04-30 10:26:17,920 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 19 selfloop transitions, 3 changer transitions 0/105 dead transitions. [2025-04-30 10:26:17,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 105 transitions, 257 flow [2025-04-30 10:26:17,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2025-04-30 10:26:17,930 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9450171821305842 [2025-04-30 10:26:17,931 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 195 flow. Second operand 3 states and 275 transitions. [2025-04-30 10:26:17,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 105 transitions, 257 flow [2025-04-30 10:26:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 105 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:17,938 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 216 flow [2025-04-30 10:26:17,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2025-04-30 10:26:17,943 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2025-04-30 10:26:17,943 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 216 flow [2025-04-30 10:26:17,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:17,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:17,944 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] [2025-04-30 10:26:17,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:17,944 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:17,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2075281972, now seen corresponding path program 1 times [2025-04-30 10:26:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:17,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981706605] [2025-04-30 10:26:17,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:17,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:17,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:26:17,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:26:17,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:17,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:18,017 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:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:18,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981706605] [2025-04-30 10:26:18,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981706605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:18,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:18,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477534874] [2025-04-30 10:26:18,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:18,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:18,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:18,031 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2025-04-30 10:26:18,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:18,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:18,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2025-04-30 10:26:18,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:18,132 INFO L116 PetriNetUnfolderBase]: 82/536 cut-off events. [2025-04-30 10:26:18,133 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-30 10:26:18,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 536 events. 82/536 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3439 event pairs, 48 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 732. Up to 149 conditions per place. [2025-04-30 10:26:18,138 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 20 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-04-30 10:26:18,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 284 flow [2025-04-30 10:26:18,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2025-04-30 10:26:18,142 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9106529209621993 [2025-04-30 10:26:18,142 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 216 flow. Second operand 3 states and 265 transitions. [2025-04-30 10:26:18,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 284 flow [2025-04-30 10:26:18,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:18,145 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 246 flow [2025-04-30 10:26:18,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2025-04-30 10:26:18,146 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 5 predicate places. [2025-04-30 10:26:18,146 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 246 flow [2025-04-30 10:26:18,146 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:18,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:18,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:18,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:26:18,146 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:18,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 297734247, now seen corresponding path program 1 times [2025-04-30 10:26:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:18,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510238366] [2025-04-30 10:26:18,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:18,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:26:18,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:26:18,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:18,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:18,299 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:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:18,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510238366] [2025-04-30 10:26:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510238366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:18,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:18,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:26:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796570820] [2025-04-30 10:26:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:18,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:18,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:18,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:18,315 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 97 [2025-04-30 10:26:18,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:18,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:18,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 97 [2025-04-30 10:26:18,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:18,367 INFO L116 PetriNetUnfolderBase]: 20/317 cut-off events. [2025-04-30 10:26:18,367 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-30 10:26:18,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 317 events. 20/317 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1519 event pairs, 12 based on Foata normal form. 2/294 useless extension candidates. Maximal degree in co-relation 378. Up to 43 conditions per place. [2025-04-30 10:26:18,369 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 10 selfloop transitions, 6 changer transitions 0/101 dead transitions. [2025-04-30 10:26:18,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 260 flow [2025-04-30 10:26:18,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2025-04-30 10:26:18,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9587628865979382 [2025-04-30 10:26:18,374 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 246 flow. Second operand 3 states and 279 transitions. [2025-04-30 10:26:18,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 260 flow [2025-04-30 10:26:18,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 242 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-30 10:26:18,378 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 232 flow [2025-04-30 10:26:18,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2025-04-30 10:26:18,380 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 2 predicate places. [2025-04-30 10:26:18,380 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 232 flow [2025-04-30 10:26:18,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:18,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:18,380 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-04-30 10:26:18,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:18,381 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:18,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1917517812, now seen corresponding path program 1 times [2025-04-30 10:26:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:18,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417729986] [2025-04-30 10:26:18,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:18,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:26:18,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:26:18,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:18,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:18,454 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:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:18,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417729986] [2025-04-30 10:26:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417729986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:18,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998383174] [2025-04-30 10:26:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:18,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:18,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:18,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:18,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2025-04-30 10:26:18,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:18,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:18,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2025-04-30 10:26:18,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:18,560 INFO L116 PetriNetUnfolderBase]: 99/649 cut-off events. [2025-04-30 10:26:18,561 INFO L117 PetriNetUnfolderBase]: For 96/100 co-relation queries the response was YES. [2025-04-30 10:26:18,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 649 events. 99/649 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4375 event pairs, 31 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 968. Up to 149 conditions per place. [2025-04-30 10:26:18,563 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 25 selfloop transitions, 6 changer transitions 3/109 dead transitions. [2025-04-30 10:26:18,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 336 flow [2025-04-30 10:26:18,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:18,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-04-30 10:26:18,565 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2025-04-30 10:26:18,565 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 232 flow. Second operand 3 states and 264 transitions. [2025-04-30 10:26:18,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 336 flow [2025-04-30 10:26:18,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:18,568 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 256 flow [2025-04-30 10:26:18,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2025-04-30 10:26:18,569 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2025-04-30 10:26:18,569 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 256 flow [2025-04-30 10:26:18,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:18,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:18,570 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-04-30 10:26:18,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:18,570 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:18,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1077198669, now seen corresponding path program 1 times [2025-04-30 10:26:18,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:18,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733648373] [2025-04-30 10:26:18,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:18,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:26:18,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:26:18,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:18,616 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:18,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:18,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733648373] [2025-04-30 10:26:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733648373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184184826] [2025-04-30 10:26:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:18,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:18,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:18,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:18,642 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2025-04-30 10:26:18,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:18,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:18,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2025-04-30 10:26:18,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:18,725 INFO L116 PetriNetUnfolderBase]: 123/749 cut-off events. [2025-04-30 10:26:18,725 INFO L117 PetriNetUnfolderBase]: For 236/246 co-relation queries the response was YES. [2025-04-30 10:26:18,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 749 events. 123/749 cut-off events. For 236/246 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5359 event pairs, 70 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1290. Up to 244 conditions per place. [2025-04-30 10:26:18,729 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 26 selfloop transitions, 3 changer transitions 3/106 dead transitions. [2025-04-30 10:26:18,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 106 transitions, 344 flow [2025-04-30 10:26:18,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-04-30 10:26:18,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8900343642611683 [2025-04-30 10:26:18,730 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 256 flow. Second operand 3 states and 259 transitions. [2025-04-30 10:26:18,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 106 transitions, 344 flow [2025-04-30 10:26:18,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 106 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:18,736 INFO L231 Difference]: Finished difference. Result has 104 places, 100 transitions, 266 flow [2025-04-30 10:26:18,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2025-04-30 10:26:18,736 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 5 predicate places. [2025-04-30 10:26:18,736 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 266 flow [2025-04-30 10:26:18,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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:18,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:18,737 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] [2025-04-30 10:26:18,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:18,737 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:18,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1011580688, now seen corresponding path program 1 times [2025-04-30 10:26:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:18,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842375454] [2025-04-30 10:26:18,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:18,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:26:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:26:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:18,770 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:18,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:18,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842375454] [2025-04-30 10:26:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842375454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:26:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768874110] [2025-04-30 10:26:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:18,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:26:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:18,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:26:18,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:26:18,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2025-04-30 10:26:18,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:18,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:18,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2025-04-30 10:26:18,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:18,862 INFO L116 PetriNetUnfolderBase]: 116/762 cut-off events. [2025-04-30 10:26:18,862 INFO L117 PetriNetUnfolderBase]: For 256/265 co-relation queries the response was YES. [2025-04-30 10:26:18,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 762 events. 116/762 cut-off events. For 256/265 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5527 event pairs, 65 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 1331. Up to 249 conditions per place. [2025-04-30 10:26:18,864 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 25 selfloop transitions, 3 changer transitions 5/107 dead transitions. [2025-04-30 10:26:18,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 107 transitions, 356 flow [2025-04-30 10:26:18,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:26:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:26:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-04-30 10:26:18,865 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8900343642611683 [2025-04-30 10:26:18,865 INFO L175 Difference]: Start difference. First operand has 104 places, 100 transitions, 266 flow. Second operand 3 states and 259 transitions. [2025-04-30 10:26:18,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 107 transitions, 356 flow [2025-04-30 10:26:18,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 107 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:26:18,867 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 276 flow [2025-04-30 10:26:18,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2025-04-30 10:26:18,868 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 7 predicate places. [2025-04-30 10:26:18,868 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 276 flow [2025-04-30 10:26:18,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:18,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:18,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:18,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:26:18,868 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-04-30 10:26:18,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash 769880707, now seen corresponding path program 1 times [2025-04-30 10:26:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:18,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627787949] [2025-04-30 10:26:18,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:18,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:26:18,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:26:18,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:18,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:18,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:18,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-30 10:26:18,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-30 10:26:18,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:18,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:18,935 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:18,936 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-04-30 10:26:18,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-04-30 10:26:18,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 13 remaining) [2025-04-30 10:26:18,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-04-30 10:26:18,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-04-30 10:26:18,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-04-30 10:26:18,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-04-30 10:26:18,938 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-04-30 10:26:18,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-04-30 10:26:18,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-04-30 10:26:18,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-04-30 10:26:18,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-04-30 10:26:18,939 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-04-30 10:26:18,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:18,940 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:18,987 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:18,987 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:18,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:18 BasicIcfg [2025-04-30 10:26:18,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:18,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:18,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:18,993 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:18,993 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:17" (3/4) ... [2025-04-30 10:26:18,994 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:19,038 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-04-30 10:26:19,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:19,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:19,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:19,065 INFO L158 Benchmark]: Toolchain (without parser) took 2577.88ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 88.4MB in the end (delta: 33.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-04-30 10:26:19,065 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:19,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.88ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 90.4MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:26:19,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.10ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 87.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:19,066 INFO L158 Benchmark]: Boogie Preprocessor took 13.51ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 86.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:19,066 INFO L158 Benchmark]: RCFGBuilder took 344.65ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 70.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:19,066 INFO L158 Benchmark]: TraceAbstraction took 1653.05ms. Allocated memory is still 167.8MB. Free memory was 70.0MB in the beginning and 98.1MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:19,066 INFO L158 Benchmark]: Witness Printer took 72.00ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 88.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:26:19,067 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.38ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.88ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 90.4MB in the end (delta: 30.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.10ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 87.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.51ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 86.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.65ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 70.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1653.05ms. Allocated memory is still 167.8MB. Free memory was 70.0MB in the beginning and 98.1MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.00ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 88.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 944]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int global; VAL [global=0] [L918] 0 pthread_mutex_t gm = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [global=0, gm={1:0}] [L927] 0 void (*f)(void) = good; VAL [f={-1:0}, global=0, gm={1:0}] [L928] 0 pthread_mutex_t fm = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [f={-1:0}, fm={2:0}, global=0, gm={1:0}] [L938] 0 pthread_t id; VAL [f={-1:0}, fm={2:0}, global=0, gm={1:0}] [L939] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [f={-1:0}, fm={2:0}, global=0, gm={1:0}, id=-1] [L941] 0 f = bad VAL [f={-1:2}, fm={2:0}, global=0, gm={1:0}, id=-1] [L930] 1 void (*g)(void); VAL [\at(arg, Pre)={0:0}, arg={0:0}, f={-1:2}, fm={2:0}, global=0, gm={1:0}] [L932] 1 g = f VAL [\at(arg, Pre)={0:0}, arg={0:0}, f={-1:2}, fm={2:0}, g={-1:2}, global=0, gm={1:0}] [L934] CALL 1 g() [L920] 1 global++ VAL [f={-1:2}, fm={2:0}, global=0, gm={1:0}] [L920] 1 global++ VAL [f={-1:2}, fm={2:0}, global=1, gm={1:0}] [L944] 0 printf("global: %d\n", global) VAL [f={-1:2}, fm={2:0}, global=1, gm={1:0}, id=-1] Now there is a data race on ~global~0 between C: global++ [920] and C: printf("global: %d\n", global) [944] - UnprovableResult [Line: 941]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 939]: 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: 932]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 920]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 920]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 924]: 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, 144 locations, 144 edges, 13 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.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 27 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=6, InterpolantAutomatonStates: 18, 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.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:19,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)