./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.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 e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:32,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:32,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:32,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:32,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:32,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:32,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:32,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:32,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:32,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:32,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:32,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:32,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:32,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:32,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:32,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:32,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:32,673 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 -> e3884759389c7a3b94642e5e46b4f06a5e829be11d2d026f21d000ba598ae6cd [2025-03-08 21:57:32,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:32,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:32,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:32,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:32,922 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:32,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2025-03-08 21:57:34,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c224ae7b/84e3b03a72c04d83b9bd73a24ad4999f/FLAGa471c8df5 [2025-03-08 21:57:34,391 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:34,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_09-tricky_address4.i [2025-03-08 21:57:34,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c224ae7b/84e3b03a72c04d83b9bd73a24ad4999f/FLAGa471c8df5 [2025-03-08 21:57:34,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c224ae7b/84e3b03a72c04d83b9bd73a24ad4999f [2025-03-08 21:57:34,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:34,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:34,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:34,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:34,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:34,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:34" (1/1) ... [2025-03-08 21:57:34,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:34, skipping insertion in model container [2025-03-08 21:57:34,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:34" (1/1) ... [2025-03-08 21:57:34,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:34,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:34,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:35,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:35,053 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:35,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35 WrapperNode [2025-03-08 21:57:35,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:35,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:35,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:35,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:35,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,104 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-03-08 21:57:35,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:35,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:35,107 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:35,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:35,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,142 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:35,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:35,143 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:35,143 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:35,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (1/1) ... [2025-03-08 21:57:35,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:35,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:57:35,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:57:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:57:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:35,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:57:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:57:35,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:35,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:35,200 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:57:35,309 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:35,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:35,587 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:35,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:35,611 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:35,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:35,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:35 BoogieIcfgContainer [2025-03-08 21:57:35,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:35,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:35,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:35,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:35,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:34" (1/3) ... [2025-03-08 21:57:35,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b85693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:35, skipping insertion in model container [2025-03-08 21:57:35,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:35" (2/3) ... [2025-03-08 21:57:35,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b85693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:35, skipping insertion in model container [2025-03-08 21:57:35,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:35" (3/3) ... [2025-03-08 21:57:35,623 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_09-tricky_address4.i [2025-03-08 21:57:35,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:35,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_09-tricky_address4.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-03-08 21:57:35,636 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:35,707 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:35,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 163 transitions, 330 flow [2025-03-08 21:57:35,792 INFO L124 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-03-08 21:57:35,796 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:35,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 162 events. 3/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-03-08 21:57:35,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 163 transitions, 330 flow [2025-03-08 21:57:35,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 162 transitions, 327 flow [2025-03-08 21:57:35,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:35,820 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;@3d739b55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:35,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 21:57:35,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:35,846 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-03-08 21:57:35,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:35,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:35,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:35,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1906204390, now seen corresponding path program 1 times [2025-03-08 21:57:35,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352855409] [2025-03-08 21:57:35,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:35,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 21:57:35,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 21:57:35,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:35,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:36,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352855409] [2025-03-08 21:57:36,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352855409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:36,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:36,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:57:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800942936] [2025-03-08 21:57:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:36,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:36,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:36,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:36,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 163 [2025-03-08 21:57:36,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:36,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:36,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 163 [2025-03-08 21:57:36,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:36,300 INFO L124 PetriNetUnfolderBase]: 7/224 cut-off events. [2025-03-08 21:57:36,301 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:36,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 224 events. 7/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 337 event pairs, 6 based on Foata normal form. 5/217 useless extension candidates. Maximal degree in co-relation 147. Up to 24 conditions per place. [2025-03-08 21:57:36,303 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2025-03-08 21:57:36,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 349 flow [2025-03-08 21:57:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-03-08 21:57:36,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950920245398773 [2025-03-08 21:57:36,319 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 327 flow. Second operand 3 states and 465 transitions. [2025-03-08 21:57:36,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 349 flow [2025-03-08 21:57:36,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:36,329 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 332 flow [2025-03-08 21:57:36,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-03-08 21:57:36,336 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2025-03-08 21:57:36,336 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 332 flow [2025-03-08 21:57:36,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:36,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:36,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:36,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:36,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash 607800763, now seen corresponding path program 1 times [2025-03-08 21:57:36,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:36,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702545760] [2025-03-08 21:57:36,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:36,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:57:36,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:57:36,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:36,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:36,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:36,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702545760] [2025-03-08 21:57:36,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702545760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:36,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11239996] [2025-03-08 21:57:36,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:36,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:36,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:36,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:36,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:57:36,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:57:36,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:57:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:36,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:57:36,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:36,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:36,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11239996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:36,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:36,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:57:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027855358] [2025-03-08 21:57:36,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:36,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:36,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:57:36,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-03-08 21:57:36,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:36,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:36,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-03-08 21:57:36,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:36,828 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-03-08 21:57:36,828 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:36,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 230 events. 7/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 330 event pairs, 6 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2025-03-08 21:57:36,831 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 14 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-03-08 21:57:36,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 396 flow [2025-03-08 21:57:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:57:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:57:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2025-03-08 21:57:36,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9188820722563054 [2025-03-08 21:57:36,837 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 332 flow. Second operand 9 states and 1348 transitions. [2025-03-08 21:57:36,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 396 flow [2025-03-08 21:57:36,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:36,840 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-03-08 21:57:36,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-03-08 21:57:36,841 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2025-03-08 21:57:36,841 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-03-08 21:57:36,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:36,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:36,842 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:36,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:57:37,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:37,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:37,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:37,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1420723355, now seen corresponding path program 2 times [2025-03-08 21:57:37,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827798106] [2025-03-08 21:57:37,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:37,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-08 21:57:37,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-03-08 21:57:37,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:37,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:57:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827798106] [2025-03-08 21:57:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827798106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395518943] [2025-03-08 21:57:37,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:37,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:37,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:38,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 163 [2025-03-08 21:57:38,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:38,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:38,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 163 [2025-03-08 21:57:38,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:38,225 INFO L124 PetriNetUnfolderBase]: 129/671 cut-off events. [2025-03-08 21:57:38,225 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:57:38,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 671 events. 129/671 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3504 event pairs, 46 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 888. Up to 178 conditions per place. [2025-03-08 21:57:38,230 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 43 selfloop transitions, 22 changer transitions 0/207 dead transitions. [2025-03-08 21:57:38,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 207 transitions, 592 flow [2025-03-08 21:57:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 888 transitions. [2025-03-08 21:57:38,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079754601226994 [2025-03-08 21:57:38,235 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 888 transitions. [2025-03-08 21:57:38,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 207 transitions, 592 flow [2025-03-08 21:57:38,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 207 transitions, 586 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:38,240 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 520 flow [2025-03-08 21:57:38,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=182, PETRI_TRANSITIONS=188} [2025-03-08 21:57:38,243 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 19 predicate places. [2025-03-08 21:57:38,244 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 520 flow [2025-03-08 21:57:38,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:38,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:38,244 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:38,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:38,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash 654774359, now seen corresponding path program 1 times [2025-03-08 21:57:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:38,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391615842] [2025-03-08 21:57:38,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:38,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:38,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 21:57:38,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 21:57:38,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:38,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:38,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391615842] [2025-03-08 21:57:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391615842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319085758] [2025-03-08 21:57:38,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:38,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:38,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:38,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:38,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:57:38,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 21:57:38,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 21:57:38,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:38,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:38,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:57:38,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319085758] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:38,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:38,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:57:38,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455732535] [2025-03-08 21:57:38,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:38,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:57:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:57:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:57:38,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-03-08 21:57:38,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 520 flow. Second operand has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:38,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:38,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-03-08 21:57:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:38,984 INFO L124 PetriNetUnfolderBase]: 41/506 cut-off events. [2025-03-08 21:57:38,984 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-08 21:57:38,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 506 events. 41/506 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2211 event pairs, 16 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 629. Up to 55 conditions per place. [2025-03-08 21:57:38,988 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 18 selfloop transitions, 21 changer transitions 0/206 dead transitions. [2025-03-08 21:57:38,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 686 flow [2025-03-08 21:57:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:57:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:57:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3130 transitions. [2025-03-08 21:57:38,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144025708442887 [2025-03-08 21:57:38,997 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 520 flow. Second operand 21 states and 3130 transitions. [2025-03-08 21:57:38,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 686 flow [2025-03-08 21:57:39,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 206 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:39,005 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 650 flow [2025-03-08 21:57:39,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=650, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2025-03-08 21:57:39,006 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 44 predicate places. [2025-03-08 21:57:39,006 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 650 flow [2025-03-08 21:57:39,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:39,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:39,008 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:39,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:39,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 21:57:39,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1119778327, now seen corresponding path program 2 times [2025-03-08 21:57:39,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:39,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048656422] [2025-03-08 21:57:39,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:39,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:39,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-03-08 21:57:39,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-03-08 21:57:39,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 21:57:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048656422] [2025-03-08 21:57:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048656422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075029007] [2025-03-08 21:57:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:39,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:39,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:39,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 163 [2025-03-08 21:57:39,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:39,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:39,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 163 [2025-03-08 21:57:39,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,181 INFO L124 PetriNetUnfolderBase]: 306/1340 cut-off events. [2025-03-08 21:57:40,183 INFO L125 PetriNetUnfolderBase]: For 280/290 co-relation queries the response was YES. [2025-03-08 21:57:40,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 1340 events. 306/1340 cut-off events. For 280/290 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9099 event pairs, 116 based on Foata normal form. 5/1232 useless extension candidates. Maximal degree in co-relation 2310. Up to 464 conditions per place. [2025-03-08 21:57:40,190 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 72 selfloop transitions, 36 changer transitions 2/258 dead transitions. [2025-03-08 21:57:40,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 258 transitions, 1022 flow [2025-03-08 21:57:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-03-08 21:57:40,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936605316973415 [2025-03-08 21:57:40,193 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 650 flow. Second operand 6 states and 874 transitions. [2025-03-08 21:57:40,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 258 transitions, 1022 flow [2025-03-08 21:57:40,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 258 transitions, 998 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:57:40,199 INFO L231 Difference]: Finished difference. Result has 210 places, 233 transitions, 878 flow [2025-03-08 21:57:40,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=210, PETRI_TRANSITIONS=233} [2025-03-08 21:57:40,201 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 47 predicate places. [2025-03-08 21:57:40,201 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 233 transitions, 878 flow [2025-03-08 21:57:40,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,202 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:40,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -381295410, now seen corresponding path program 1 times [2025-03-08 21:57:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153820332] [2025-03-08 21:57:40,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 21:57:40,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 21:57:40,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153820332] [2025-03-08 21:57:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153820332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420180700] [2025-03-08 21:57:40,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:40,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:57:40,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:57:40,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 21:57:40,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 21:57:40,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:57:40,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:40,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:40,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420180700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:40,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:40,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 21:57:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904482992] [2025-03-08 21:57:40,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:40,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:57:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:40,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:57:40,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:57:40,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-03-08 21:57:40,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 233 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:40,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-03-08 21:57:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:41,131 INFO L124 PetriNetUnfolderBase]: 120/944 cut-off events. [2025-03-08 21:57:41,131 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-03-08 21:57:41,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 944 events. 120/944 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5981 event pairs, 33 based on Foata normal form. 3/888 useless extension candidates. Maximal degree in co-relation 1568. Up to 134 conditions per place. [2025-03-08 21:57:41,135 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 21 selfloop transitions, 30 changer transitions 0/250 dead transitions. [2025-03-08 21:57:41,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 250 transitions, 1102 flow [2025-03-08 21:57:41,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 21:57:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 21:57:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4464 transitions. [2025-03-08 21:57:41,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912883435582822 [2025-03-08 21:57:41,141 INFO L175 Difference]: Start difference. First operand has 210 places, 233 transitions, 878 flow. Second operand 30 states and 4464 transitions. [2025-03-08 21:57:41,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 250 transitions, 1102 flow [2025-03-08 21:57:41,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 250 transitions, 1078 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:41,146 INFO L231 Difference]: Finished difference. Result has 242 places, 243 transitions, 1006 flow [2025-03-08 21:57:41,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1006, PETRI_PLACES=242, PETRI_TRANSITIONS=243} [2025-03-08 21:57:41,147 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2025-03-08 21:57:41,147 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 243 transitions, 1006 flow [2025-03-08 21:57:41,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:41,148 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:41,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 21:57:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:41,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -69079933, now seen corresponding path program 2 times [2025-03-08 21:57:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269675119] [2025-03-08 21:57:41,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:41,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-03-08 21:57:41,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 157 statements. [2025-03-08 21:57:41,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:41,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:41,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269675119] [2025-03-08 21:57:41,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269675119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:41,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:41,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521078765] [2025-03-08 21:57:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:41,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:41,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:41,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:41,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:41,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 163 [2025-03-08 21:57:41,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 243 transitions, 1006 flow. Second operand has 6 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:41,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 163 [2025-03-08 21:57:41,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:42,120 INFO L124 PetriNetUnfolderBase]: 306/1461 cut-off events. [2025-03-08 21:57:42,120 INFO L125 PetriNetUnfolderBase]: For 883/923 co-relation queries the response was YES. [2025-03-08 21:57:42,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1461 events. 306/1461 cut-off events. For 883/923 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10346 event pairs, 72 based on Foata normal form. 10/1424 useless extension candidates. Maximal degree in co-relation 3050. Up to 456 conditions per place. [2025-03-08 21:57:42,128 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 80 selfloop transitions, 49 changer transitions 0/309 dead transitions. [2025-03-08 21:57:42,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 309 transitions, 1563 flow [2025-03-08 21:57:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2025-03-08 21:57:42,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130879345603272 [2025-03-08 21:57:42,131 INFO L175 Difference]: Start difference. First operand has 242 places, 243 transitions, 1006 flow. Second operand 6 states and 893 transitions. [2025-03-08 21:57:42,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 309 transitions, 1563 flow [2025-03-08 21:57:42,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 309 transitions, 1517 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-08 21:57:42,142 INFO L231 Difference]: Finished difference. Result has 233 places, 284 transitions, 1376 flow [2025-03-08 21:57:42,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1376, PETRI_PLACES=233, PETRI_TRANSITIONS=284} [2025-03-08 21:57:42,144 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 70 predicate places. [2025-03-08 21:57:42,144 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 284 transitions, 1376 flow [2025-03-08 21:57:42,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:42,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:42,144 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:42,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:57:42,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:42,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:42,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1836272135, now seen corresponding path program 1 times [2025-03-08 21:57:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:42,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068448077] [2025-03-08 21:57:42,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:42,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 21:57:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 21:57:42,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:42,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:57:42,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:42,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068448077] [2025-03-08 21:57:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068448077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708148155] [2025-03-08 21:57:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:42,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:42,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:42,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:42,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 163 [2025-03-08 21:57:42,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 284 transitions, 1376 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:42,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:42,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 163 [2025-03-08 21:57:42,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:43,171 INFO L124 PetriNetUnfolderBase]: 579/2228 cut-off events. [2025-03-08 21:57:43,172 INFO L125 PetriNetUnfolderBase]: For 2429/2489 co-relation queries the response was YES. [2025-03-08 21:57:43,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2228 events. 579/2228 cut-off events. For 2429/2489 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17326 event pairs, 140 based on Foata normal form. 12/2155 useless extension candidates. Maximal degree in co-relation 5642. Up to 824 conditions per place. [2025-03-08 21:57:43,184 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 119 selfloop transitions, 78 changer transitions 11/378 dead transitions. [2025-03-08 21:57:43,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 378 transitions, 2316 flow [2025-03-08 21:57:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2025-03-08 21:57:43,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8987730061349694 [2025-03-08 21:57:43,186 INFO L175 Difference]: Start difference. First operand has 233 places, 284 transitions, 1376 flow. Second operand 6 states and 879 transitions. [2025-03-08 21:57:43,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 378 transitions, 2316 flow [2025-03-08 21:57:43,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 378 transitions, 2314 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:43,200 INFO L231 Difference]: Finished difference. Result has 242 places, 332 transitions, 1980 flow [2025-03-08 21:57:43,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1374, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1980, PETRI_PLACES=242, PETRI_TRANSITIONS=332} [2025-03-08 21:57:43,201 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 79 predicate places. [2025-03-08 21:57:43,201 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 332 transitions, 1980 flow [2025-03-08 21:57:43,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:43,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:43,202 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:43,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:57:43,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:57:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 576807169, now seen corresponding path program 1 times [2025-03-08 21:57:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603744127] [2025-03-08 21:57:43,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:43,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 21:57:43,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 21:57:43,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:43,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:57:43,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:57:43,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 21:57:43,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 21:57:43,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:43,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:57:43,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:57:43,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:57:43,295 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-08 21:57:43,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-08 21:57:43,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-08 21:57:43,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-08 21:57:43,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-08 21:57:43,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-08 21:57:43,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-08 21:57:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:57:43,297 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1] [2025-03-08 21:57:43,344 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:57:43,344 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:57:43,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:57:43 BasicIcfg [2025-03-08 21:57:43,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:57:43,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:57:43,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:57:43,351 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:57:43,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:35" (3/4) ... [2025-03-08 21:57:43,352 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:57:43,393 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 18. [2025-03-08 21:57:43,438 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:57:43,438 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:57:43,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:57:43,439 INFO L158 Benchmark]: Toolchain (without parser) took 8772.05ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 121.6MB in the beginning and 114.0MB in the end (delta: 7.6MB). Peak memory consumption was 190.8MB. Max. memory is 16.1GB. [2025-03-08 21:57:43,439 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:43,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.28ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 91.7MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 21:57:43,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.76ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 88.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:43,440 INFO L158 Benchmark]: Boogie Preprocessor took 36.63ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:43,440 INFO L158 Benchmark]: IcfgBuilder took 471.67ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 64.6MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:57:43,441 INFO L158 Benchmark]: TraceAbstraction took 7733.91ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 63.9MB in the beginning and 126.3MB in the end (delta: -62.4MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2025-03-08 21:57:43,441 INFO L158 Benchmark]: Witness Printer took 87.53ms. Allocated memory is still 352.3MB. Free memory was 126.3MB in the beginning and 114.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:43,442 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.28ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.28ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 91.7MB in the end (delta: 29.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.76ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 88.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.63ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 471.67ms. Allocated memory is still 167.8MB. Free memory was 87.2MB in the beginning and 64.6MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7733.91ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 63.9MB in the beginning and 126.3MB in the end (delta: -62.4MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Witness Printer took 87.53ms. Allocated memory is still 352.3MB. Free memory was 126.3MB in the beginning and 114.0MB in the end (delta: 12.3MB). 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: [L922-L925] 0 struct s { int datum; pthread_mutex_t mutex; } a[10]; VAL [a={1:0}] [L937] 0 int i = 0; VAL [a={1:0}, i=0] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=1] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=2] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=3] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=4] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=5] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=6] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=7] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=8] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=9] [L937] COND TRUE 0 i < 10 VAL [a={1:0}] [L937] 0 i++ VAL [a={1:0}, i=10] [L937] COND FALSE 0 !(i < 10) VAL [a={1:0}] [L939] 0 int i = __VERIFIER_nondet_int(); VAL [a={1:0}, i=9] [L940] CALL 0 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 0 !(!cond) VAL [\old(cond)=1, a={1:0}, cond=1] [L940] RET 0 assume_abort_if_not(0 <= i && i < 10) [L941] 0 pthread_t t1; VAL [a={1:0}, i=9] [L942] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [a={1:0}, i=9, t1=-1] [L927] 1 int i = __VERIFIER_nondet_int(); VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=8] [L928] CALL 1 assume_abort_if_not(0 <= i && i < 9) [L11] COND FALSE 1 !(!cond) VAL [\old(cond)=1, a={1:0}, cond=1] [L928] RET 1 assume_abort_if_not(0 <= i && i < 9) [L929] 1 struct s *p = &a[i]; VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=8, p={1:224}] [L931] 1 i++ VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L944] EXPR 0 a[i].datum VAL [a={1:0}, i=9, t1=-1] [L944] 0 a[i].datum++ VAL [a={1:0}, i=9, t1=-1] [L932] EXPR 1 a[i].datum VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L932] 1 a[i].datum++ VAL [\old(arg)={0:0}, a={1:0}, arg={0:0}, i=9, p={1:224}] [L944] 0 a[i].datum++ VAL [a={1:0}, i=9, t1=-1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: a[i].datum++ [932] * C: a[i].datum++ [944] * C: a[i].datum++ [944] * C: a[i].datum++ [944] * C: a[i].datum++ [944] and C: a[i].datum++ [944] - UnprovableResult [Line: 944]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 942]: 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: 932]: 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, 204 locations, 206 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.6s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1756 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1322 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3057 IncrementalHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 109 mSDtfsCounter, 3057 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 695 SyntacticMatches, 11 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1980occurred in iteration=8, InterpolantAutomatonStates: 87, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1549 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1722 ConstructedInterpolants, 0 QuantifiedInterpolants, 2532 SizeOfPredicates, 22 NumberOfNonLiveVariables, 760 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 600/993 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 21:57:43,457 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)