./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.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/04-mutex_44-malloc_sound.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 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:08,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:08,805 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:08,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:08,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:08,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:08,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:08,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:08,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:08,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:08,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:08,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:08,835 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:08,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:08,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:08,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:08,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:08,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:08,837 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 -> 8d85985769788fe03edac99b0e2515850ec4c864737a042b27bc3e336515bcde [2025-03-08 21:57:09,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:09,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:09,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:09,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:09,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:09,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i [2025-03-08 21:57:10,198 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4c75a06/24a62e02ce7b4f628af06fb0a057d2d5/FLAGc0cc57d4f [2025-03-08 21:57:10,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:10,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_44-malloc_sound.i [2025-03-08 21:57:10,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4c75a06/24a62e02ce7b4f628af06fb0a057d2d5/FLAGc0cc57d4f [2025-03-08 21:57:10,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4c75a06/24a62e02ce7b4f628af06fb0a057d2d5 [2025-03-08 21:57:10,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:10,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:10,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:10,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:10,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:10,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:10" (1/1) ... [2025-03-08 21:57:10,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4097adf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:10, skipping insertion in model container [2025-03-08 21:57:10,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:10" (1/1) ... [2025-03-08 21:57:10,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:11,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:11,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:11,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:11,309 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:11,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:11 WrapperNode [2025-03-08 21:57:11,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:11,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:11,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:11,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:11,315 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:11" (1/1) ... [2025-03-08 21:57:11,327 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:11" (1/1) ... [2025-03-08 21:57:11,346 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-03-08 21:57:11,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:11,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:11,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:11,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:11,352 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:11" (1/1) ... [2025-03-08 21:57:11,353 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:11" (1/1) ... [2025-03-08 21:57:11,355 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:11" (1/1) ... [2025-03-08 21:57:11,357 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:11" (1/1) ... [2025-03-08 21:57:11,360 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:11" (1/1) ... [2025-03-08 21:57:11,366 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:11" (1/1) ... [2025-03-08 21:57:11,367 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:11" (1/1) ... [2025-03-08 21:57:11,368 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:11" (1/1) ... [2025-03-08 21:57:11,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:11,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:11,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:11,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:11,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:11" (1/1) ... [2025-03-08 21:57:11,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:11,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:11,403 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:11,406 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:11,424 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-08 21:57:11,424 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-08 21:57:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:57:11,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:11,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:11,426 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:11,533 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:11,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:11,685 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:11,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:11,701 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:11,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:11,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:11 BoogieIcfgContainer [2025-03-08 21:57:11,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:11,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:11,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:11,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:11,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:10" (1/3) ... [2025-03-08 21:57:11,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fc7a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:11, skipping insertion in model container [2025-03-08 21:57:11,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:11" (2/3) ... [2025-03-08 21:57:11,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fc7a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:11, skipping insertion in model container [2025-03-08 21:57:11,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:11" (3/3) ... [2025-03-08 21:57:11,707 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.i [2025-03-08 21:57:11,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:11,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_44-malloc_sound.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2025-03-08 21:57:11,717 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:11,754 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:11,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 186 flow [2025-03-08 21:57:11,804 INFO L124 PetriNetUnfolderBase]: 3/90 cut-off events. [2025-03-08 21:57:11,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:11,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 90 events. 3/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-08 21:57:11,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 186 flow [2025-03-08 21:57:11,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 90 transitions, 183 flow [2025-03-08 21:57:11,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:11,826 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;@6b7d8974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:11,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-08 21:57:11,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:11,839 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2025-03-08 21:57:11,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:11,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:11,840 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] [2025-03-08 21:57:11,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:11,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 879320070, now seen corresponding path program 1 times [2025-03-08 21:57:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:11,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080532397] [2025-03-08 21:57:11,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:11,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 21:57:11,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 21:57:11,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:11,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:12,002 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:12,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:12,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080532397] [2025-03-08 21:57:12,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080532397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:12,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:12,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:57:12,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910820581] [2025-03-08 21:57:12,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:12,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:12,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:12,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:12,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:12,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-03-08 21:57:12,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:12,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:12,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-03-08 21:57:12,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:12,120 INFO L124 PetriNetUnfolderBase]: 9/165 cut-off events. [2025-03-08 21:57:12,121 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:12,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 165 events. 9/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 397 event pairs, 6 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 134. Up to 26 conditions per place. [2025-03-08 21:57:12,123 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-08 21:57:12,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 213 flow [2025-03-08 21:57:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-08 21:57:12,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-03-08 21:57:12,137 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 183 flow. Second operand 3 states and 251 transitions. [2025-03-08 21:57:12,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 213 flow [2025-03-08 21:57:12,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:12,145 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 198 flow [2025-03-08 21:57:12,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2025-03-08 21:57:12,149 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-03-08 21:57:12,151 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 198 flow [2025-03-08 21:57:12,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:12,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:12,151 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] [2025-03-08 21:57:12,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:12,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1517926809, now seen corresponding path program 1 times [2025-03-08 21:57:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229800121] [2025-03-08 21:57:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:12,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 21:57:12,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 21:57:12,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:12,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:12,305 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:12,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:12,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229800121] [2025-03-08 21:57:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229800121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:12,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528032527] [2025-03-08 21:57:12,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:12,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:12,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:12,308 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:12,310 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:12,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 21:57:12,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 21:57:12,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:12,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:12,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:12,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:57:12,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528032527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:12,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067515282] [2025-03-08 21:57:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:12,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:12,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:12,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:12,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-03-08 21:57:12,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:12,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:12,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-03-08 21:57:12,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:12,479 INFO L124 PetriNetUnfolderBase]: 15/151 cut-off events. [2025-03-08 21:57:12,479 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 151 events. 15/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 424 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 170. Up to 30 conditions per place. [2025-03-08 21:57:12,481 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2025-03-08 21:57:12,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 222 flow [2025-03-08 21:57:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-08 21:57:12,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-03-08 21:57:12,482 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 198 flow. Second operand 3 states and 251 transitions. [2025-03-08 21:57:12,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 222 flow [2025-03-08 21:57:12,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:12,485 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 194 flow [2025-03-08 21:57:12,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-03-08 21:57:12,486 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-08 21:57:12,486 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 194 flow [2025-03-08 21:57:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:12,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:12,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:12,492 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:12,686 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:12,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 187083885, now seen corresponding path program 1 times [2025-03-08 21:57:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385597655] [2025-03-08 21:57:12,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:12,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:57:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:57:12,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:12,789 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:12,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:12,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385597655] [2025-03-08 21:57:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385597655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799915293] [2025-03-08 21:57:12,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:12,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:12,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:12,805 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:12,806 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:12,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:57:12,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:57:12,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:12,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:12,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:12,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:57:12,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799915293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:12,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134411068] [2025-03-08 21:57:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:12,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:12,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:12,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-03-08 21:57:12,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:12,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:12,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-03-08 21:57:12,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:12,919 INFO L124 PetriNetUnfolderBase]: 15/153 cut-off events. [2025-03-08 21:57:12,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:12,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 153 events. 15/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 415 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 145. Up to 30 conditions per place. [2025-03-08 21:57:12,920 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-03-08 21:57:12,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 218 flow [2025-03-08 21:57:12,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-03-08 21:57:12,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-03-08 21:57:12,922 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 194 flow. Second operand 3 states and 251 transitions. [2025-03-08 21:57:12,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 218 flow [2025-03-08 21:57:12,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:12,924 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 191 flow [2025-03-08 21:57:12,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-03-08 21:57:12,925 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2025-03-08 21:57:12,925 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 191 flow [2025-03-08 21:57:12,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:12,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:12,925 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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:12,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:57:13,126 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,SelfDestructingSolverStorable2 [2025-03-08 21:57:13,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:13,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1946676982, now seen corresponding path program 1 times [2025-03-08 21:57:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:13,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277066544] [2025-03-08 21:57:13,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:13,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 21:57:13,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 21:57:13,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277066544] [2025-03-08 21:57:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277066544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943950943] [2025-03-08 21:57:13,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:13,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:13,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:13,224 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:13,226 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:13,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 21:57:13,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 21:57:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:13,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:13,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:57:13,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:13,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943950943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607423410] [2025-03-08 21:57:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:13,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:13,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:13,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:13,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-03-08 21:57:13,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:13,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:13,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-03-08 21:57:13,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:13,342 INFO L124 PetriNetUnfolderBase]: 18/201 cut-off events. [2025-03-08 21:57:13,342 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 21:57:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 201 events. 18/201 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 10 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 146. Up to 35 conditions per place. [2025-03-08 21:57:13,343 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 14 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-03-08 21:57:13,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 91 transitions, 237 flow [2025-03-08 21:57:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-03-08 21:57:13,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-03-08 21:57:13,344 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 191 flow. Second operand 3 states and 252 transitions. [2025-03-08 21:57:13,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 91 transitions, 237 flow [2025-03-08 21:57:13,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:13,345 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 206 flow [2025-03-08 21:57:13,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-03-08 21:57:13,346 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-08 21:57:13,346 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 206 flow [2025-03-08 21:57:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:13,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:13,346 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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:13,353 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:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:13,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:13,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 247439949, now seen corresponding path program 1 times [2025-03-08 21:57:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230017753] [2025-03-08 21:57:13,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:13,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 21:57:13,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 21:57:13,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:13,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230017753] [2025-03-08 21:57:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230017753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:13,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513148891] [2025-03-08 21:57:13,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:13,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:13,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:13,619 INFO L229 MonitoredProcess]: Starting monitored process 5 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:13,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:57:13,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 21:57:13,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 21:57:13,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:13,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:13,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:13,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 21:57:13,672 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513148891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:13,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:13,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:13,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175162918] [2025-03-08 21:57:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:13,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:13,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:13,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:13,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-03-08 21:57:13,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:13,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:13,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-03-08 21:57:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:13,723 INFO L124 PetriNetUnfolderBase]: 28/293 cut-off events. [2025-03-08 21:57:13,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:13,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 293 events. 28/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1229 event pairs, 13 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 286. Up to 48 conditions per place. [2025-03-08 21:57:13,725 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 14 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-03-08 21:57:13,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 255 flow [2025-03-08 21:57:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-03-08 21:57:13,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9267399267399268 [2025-03-08 21:57:13,726 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 206 flow. Second operand 3 states and 253 transitions. [2025-03-08 21:57:13,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 255 flow [2025-03-08 21:57:13,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:13,728 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 226 flow [2025-03-08 21:57:13,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-03-08 21:57:13,728 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-03-08 21:57:13,728 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 226 flow [2025-03-08 21:57:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:13,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:13,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:13,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:57:13,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:13,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1391399337, now seen corresponding path program 1 times [2025-03-08 21:57:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761724843] [2025-03-08 21:57:13,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:13,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 21:57:13,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 21:57:13,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:13,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:13,975 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:13,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761724843] [2025-03-08 21:57:13,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761724843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226208553] [2025-03-08 21:57:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:13,977 INFO L229 MonitoredProcess]: Starting monitored process 6 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:13,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:57:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 21:57:14,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 21:57:14,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:14,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:14,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:14,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:57:14,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226208553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:14,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62075116] [2025-03-08 21:57:14,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:14,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:14,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:14,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:14,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-03-08 21:57:14,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:14,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:14,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-03-08 21:57:14,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:14,107 INFO L124 PetriNetUnfolderBase]: 46/395 cut-off events. [2025-03-08 21:57:14,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:14,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 395 events. 46/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2023 event pairs, 15 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 440. Up to 56 conditions per place. [2025-03-08 21:57:14,108 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 17 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-03-08 21:57:14,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 292 flow [2025-03-08 21:57:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-03-08 21:57:14,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-03-08 21:57:14,109 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 226 flow. Second operand 3 states and 259 transitions. [2025-03-08 21:57:14,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 292 flow [2025-03-08 21:57:14,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:14,111 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 274 flow [2025-03-08 21:57:14,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-03-08 21:57:14,112 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-03-08 21:57:14,112 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 274 flow [2025-03-08 21:57:14,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:14,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:14,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:14,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:14,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:14,316 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1463410921, now seen corresponding path program 1 times [2025-03-08 21:57:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539710590] [2025-03-08 21:57:14,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:14,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 21:57:14,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 21:57:14,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:14,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:14,367 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:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539710590] [2025-03-08 21:57:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539710590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226875669] [2025-03-08 21:57:14,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:14,371 INFO L229 MonitoredProcess]: Starting monitored process 7 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:14,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:57:14,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 21:57:14,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 21:57:14,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:14,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:14,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:57:14,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226875669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073751715] [2025-03-08 21:57:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:14,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:14,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:14,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:14,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-03-08 21:57:14,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:14,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:14,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-03-08 21:57:14,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:14,498 INFO L124 PetriNetUnfolderBase]: 61/460 cut-off events. [2025-03-08 21:57:14,499 INFO L125 PetriNetUnfolderBase]: For 103/108 co-relation queries the response was YES. [2025-03-08 21:57:14,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 460 events. 61/460 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2570 event pairs, 23 based on Foata normal form. 3/442 useless extension candidates. Maximal degree in co-relation 524. Up to 103 conditions per place. [2025-03-08 21:57:14,501 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 16 selfloop transitions, 7 changer transitions 2/103 dead transitions. [2025-03-08 21:57:14,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 103 transitions, 346 flow [2025-03-08 21:57:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-08 21:57:14,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2025-03-08 21:57:14,502 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 274 flow. Second operand 3 states and 254 transitions. [2025-03-08 21:57:14,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 103 transitions, 346 flow [2025-03-08 21:57:14,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:14,504 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 314 flow [2025-03-08 21:57:14,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-03-08 21:57:14,505 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 7 predicate places. [2025-03-08 21:57:14,505 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 314 flow [2025-03-08 21:57:14,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:14,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:14,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:14,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:14,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:14,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:14,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash -781206752, now seen corresponding path program 1 times [2025-03-08 21:57:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998765053] [2025-03-08 21:57:14,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:14,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:57:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:57:14,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:14,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:14,752 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:14,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:14,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998765053] [2025-03-08 21:57:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998765053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:14,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351661390] [2025-03-08 21:57:14,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:14,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:14,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:14,754 INFO L229 MonitoredProcess]: Starting monitored process 8 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:14,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 21:57:14,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 21:57:14,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 21:57:14,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:14,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:14,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:57:14,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:57:14,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:57:14,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351661390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:14,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:57:14,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:57:14,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785966615] [2025-03-08 21:57:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:14,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:14,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:14,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:14,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:14,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-03-08 21:57:14,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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:14,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:14,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-03-08 21:57:14,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:14,876 INFO L124 PetriNetUnfolderBase]: 79/520 cut-off events. [2025-03-08 21:57:14,876 INFO L125 PetriNetUnfolderBase]: For 229/236 co-relation queries the response was YES. [2025-03-08 21:57:14,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 520 events. 79/520 cut-off events. For 229/236 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3027 event pairs, 27 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 718. Up to 128 conditions per place. [2025-03-08 21:57:14,877 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 17 selfloop transitions, 7 changer transitions 7/107 dead transitions. [2025-03-08 21:57:14,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 400 flow [2025-03-08 21:57:14,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-08 21:57:14,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2025-03-08 21:57:14,878 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 314 flow. Second operand 3 states and 250 transitions. [2025-03-08 21:57:14,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 400 flow [2025-03-08 21:57:14,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:14,882 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 332 flow [2025-03-08 21:57:14,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-03-08 21:57:14,883 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-03-08 21:57:14,883 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 332 flow [2025-03-08 21:57:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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:14,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:14,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:14,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 21:57:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:15,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1487031865, now seen corresponding path program 1 times [2025-03-08 21:57:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913605358] [2025-03-08 21:57:15,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:15,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 21:57:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 21:57:15,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:15,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:15,149 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:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913605358] [2025-03-08 21:57:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913605358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129659879] [2025-03-08 21:57:15,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:15,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:15,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:15,152 INFO L229 MonitoredProcess]: Starting monitored process 9 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:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 21:57:15,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 21:57:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 21:57:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:15,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:57:15,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:15,258 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:15,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:15,298 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:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129659879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:15,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:57:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608613475] [2025-03-08 21:57:15,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:57:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:15,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:57:15,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:57:15,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-03-08 21:57:15,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 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:15,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:15,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-03-08 21:57:15,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:15,451 INFO L124 PetriNetUnfolderBase]: 40/464 cut-off events. [2025-03-08 21:57:15,451 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-08 21:57:15,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 464 events. 40/464 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2390 event pairs, 12 based on Foata normal form. 7/458 useless extension candidates. Maximal degree in co-relation 508. Up to 54 conditions per place. [2025-03-08 21:57:15,453 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2025-03-08 21:57:15,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 416 flow [2025-03-08 21:57:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:57:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 21:57:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2025-03-08 21:57:15,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8561438561438561 [2025-03-08 21:57:15,455 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 332 flow. Second operand 11 states and 857 transitions. [2025-03-08 21:57:15,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 416 flow [2025-03-08 21:57:15,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:15,460 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 392 flow [2025-03-08 21:57:15,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-03-08 21:57:15,461 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2025-03-08 21:57:15,461 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 392 flow [2025-03-08 21:57:15,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 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:15,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:15,462 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-08 21:57:15,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:15,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 21:57:15,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:15,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 107257221, now seen corresponding path program 2 times [2025-03-08 21:57:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932221564] [2025-03-08 21:57:15,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:15,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-08 21:57:15,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 66 statements. [2025-03-08 21:57:15,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:15,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 21:57:15,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932221564] [2025-03-08 21:57:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932221564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:15,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161564261] [2025-03-08 21:57:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:57:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:15,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:57:15,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:57:15,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 91 [2025-03-08 21:57:15,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 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:15,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:15,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 91 [2025-03-08 21:57:15,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:15,888 INFO L124 PetriNetUnfolderBase]: 58/797 cut-off events. [2025-03-08 21:57:15,889 INFO L125 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-03-08 21:57:15,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 797 events. 58/797 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5335 event pairs, 13 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 487. Up to 74 conditions per place. [2025-03-08 21:57:15,892 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 13 selfloop transitions, 11 changer transitions 8/130 dead transitions. [2025-03-08 21:57:15,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 504 flow [2025-03-08 21:57:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:57:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 21:57:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2025-03-08 21:57:15,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434850863422292 [2025-03-08 21:57:15,894 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 392 flow. Second operand 7 states and 601 transitions. [2025-03-08 21:57:15,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 504 flow [2025-03-08 21:57:15,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 492 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:15,898 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 429 flow [2025-03-08 21:57:15,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2025-03-08 21:57:15,899 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 27 predicate places. [2025-03-08 21:57:15,899 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 429 flow [2025-03-08 21:57:15,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 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:15,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:15,900 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 21:57:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:57:15,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1831036701, now seen corresponding path program 1 times [2025-03-08 21:57:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:15,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907684315] [2025-03-08 21:57:15,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 21:57:15,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 21:57:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:57:16,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907684315] [2025-03-08 21:57:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907684315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051940978] [2025-03-08 21:57:16,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:16,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:16,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:16,021 INFO L229 MonitoredProcess]: Starting monitored process 10 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:16,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 21:57:16,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 21:57:16,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 21:57:16,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:16,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:16,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 21:57:16,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:57:16,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 21:57:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051940978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:16,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-08 21:57:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508802446] [2025-03-08 21:57:16,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 21:57:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:16,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 21:57:16,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-08 21:57:16,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-03-08 21:57:16,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 429 flow. Second operand has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 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:16,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:16,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-03-08 21:57:16,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:16,424 INFO L124 PetriNetUnfolderBase]: 58/761 cut-off events. [2025-03-08 21:57:16,425 INFO L125 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-03-08 21:57:16,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 761 events. 58/761 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4474 event pairs, 14 based on Foata normal form. 14/754 useless extension candidates. Maximal degree in co-relation 594. Up to 94 conditions per place. [2025-03-08 21:57:16,428 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 21 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2025-03-08 21:57:16,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 569 flow [2025-03-08 21:57:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 21:57:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-08 21:57:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2025-03-08 21:57:16,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.861021331609567 [2025-03-08 21:57:16,431 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 429 flow. Second operand 17 states and 1332 transitions. [2025-03-08 21:57:16,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 569 flow [2025-03-08 21:57:16,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 567 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:16,435 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 560 flow [2025-03-08 21:57:16,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=560, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2025-03-08 21:57:16,437 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 46 predicate places. [2025-03-08 21:57:16,437 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 560 flow [2025-03-08 21:57:16,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 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:16,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:16,439 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 21:57:16,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:16,639 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:16,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:16,640 INFO L85 PathProgramCache]: Analyzing trace with hash -368305191, now seen corresponding path program 1 times [2025-03-08 21:57:16,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:16,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616084948] [2025-03-08 21:57:16,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:16,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:16,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 21:57:16,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 21:57:16,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:16,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 21:57:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616084948] [2025-03-08 21:57:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616084948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145308373] [2025-03-08 21:57:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:16,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:16,782 INFO L229 MonitoredProcess]: Starting monitored process 11 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:16,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 21:57:16,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 21:57:16,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 21:57:16,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:16,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:16,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:57:16,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 21:57:16,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 21:57:16,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145308373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:16,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:16,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 21:57:16,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183360682] [2025-03-08 21:57:16,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:16,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:57:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:16,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:57:16,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:57:17,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2025-03-08 21:57:17,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 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:17,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:17,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2025-03-08 21:57:17,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:17,202 INFO L124 PetriNetUnfolderBase]: 64/772 cut-off events. [2025-03-08 21:57:17,202 INFO L125 PetriNetUnfolderBase]: For 549/555 co-relation queries the response was YES. [2025-03-08 21:57:17,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 772 events. 64/772 cut-off events. For 549/555 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3612 event pairs, 13 based on Foata normal form. 9/761 useless extension candidates. Maximal degree in co-relation 820. Up to 66 conditions per place. [2025-03-08 21:57:17,205 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 29 selfloop transitions, 45 changer transitions 1/158 dead transitions. [2025-03-08 21:57:17,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 158 transitions, 906 flow [2025-03-08 21:57:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:57:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:57:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1613 transitions. [2025-03-08 21:57:17,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8440607012035584 [2025-03-08 21:57:17,208 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 560 flow. Second operand 21 states and 1613 transitions. [2025-03-08 21:57:17,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 158 transitions, 906 flow [2025-03-08 21:57:17,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 888 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:17,212 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 823 flow [2025-03-08 21:57:17,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=823, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2025-03-08 21:57:17,212 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 65 predicate places. [2025-03-08 21:57:17,212 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 823 flow [2025-03-08 21:57:17,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 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:17,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:17,213 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2025-03-08 21:57:17,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 21:57:17,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 21:57:17,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:17,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:17,418 INFO L85 PathProgramCache]: Analyzing trace with hash -321000135, now seen corresponding path program 2 times [2025-03-08 21:57:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365650747] [2025-03-08 21:57:17,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:17,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-08 21:57:17,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 21:57:17,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:57:17,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:57:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365650747] [2025-03-08 21:57:17,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365650747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:57:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855416301] [2025-03-08 21:57:17,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:57:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:17,613 INFO L229 MonitoredProcess]: Starting monitored process 12 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:17,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 21:57:17,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-08 21:57:17,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 21:57:17,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:57:17,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:17,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 21:57:17,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:57:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:57:17,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:57:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:57:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855416301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:57:17,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:57:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2025-03-08 21:57:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668571219] [2025-03-08 21:57:17,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:57:17,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 21:57:17,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:17,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 21:57:17,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-08 21:57:17,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-03-08 21:57:17,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 823 flow. Second operand has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 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:17,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:17,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-03-08 21:57:17,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:18,143 INFO L124 PetriNetUnfolderBase]: 37/455 cut-off events. [2025-03-08 21:57:18,143 INFO L125 PetriNetUnfolderBase]: For 499/501 co-relation queries the response was YES. [2025-03-08 21:57:18,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 455 events. 37/455 cut-off events. For 499/501 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1557 event pairs, 5 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 752. Up to 53 conditions per place. [2025-03-08 21:57:18,144 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 35 selfloop transitions, 34 changer transitions 0/153 dead transitions. [2025-03-08 21:57:18,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 153 transitions, 1011 flow [2025-03-08 21:57:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:57:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:57:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1623 transitions. [2025-03-08 21:57:18,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8492935635792779 [2025-03-08 21:57:18,147 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 823 flow. Second operand 21 states and 1623 transitions. [2025-03-08 21:57:18,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 153 transitions, 1011 flow [2025-03-08 21:57:18,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 153 transitions, 911 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-03-08 21:57:18,152 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 860 flow [2025-03-08 21:57:18,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=860, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2025-03-08 21:57:18,152 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 81 predicate places. [2025-03-08 21:57:18,152 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 860 flow [2025-03-08 21:57:18,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 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:18,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:18,153 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 21:57:18,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 21:57:18,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 21:57:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2140010804, now seen corresponding path program 1 times [2025-03-08 21:57:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:18,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850314464] [2025-03-08 21:57:18,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:18,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 21:57:18,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 21:57:18,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:57:18,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:57:18,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 21:57:18,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 21:57:18,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:18,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:57:18,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:57:18,433 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:57:18,434 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-03-08 21:57:18,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-08 21:57:18,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-08 21:57:18,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-08 21:57:18,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-08 21:57:18,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-08 21:57:18,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-08 21:57:18,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:57:18,436 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:18,513 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:57:18,513 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:57:18,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:57:18 BasicIcfg [2025-03-08 21:57:18,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:57:18,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:57:18,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:57:18,520 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:57:18,520 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:11" (3/4) ... [2025-03-08 21:57:18,521 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:57:18,581 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-03-08 21:57:18,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:57:18,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:57:18,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:57:18,639 INFO L158 Benchmark]: Toolchain (without parser) took 7773.21ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.8MB in the beginning and 341.7MB in the end (delta: -230.8MB). Peak memory consumption was 50.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:18,639 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:18,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.97ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 84.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:57:18,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.52ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:57:18,640 INFO L158 Benchmark]: Boogie Preprocessor took 24.82ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 81.2MB in the end (delta: 872.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:18,640 INFO L158 Benchmark]: IcfgBuilder took 328.15ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 65.7MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:18,640 INFO L158 Benchmark]: TraceAbstraction took 6816.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.2MB in the beginning and 357.8MB in the end (delta: -292.6MB). Peak memory consumption was 64.3kB. Max. memory is 16.1GB. [2025-03-08 21:57:18,640 INFO L158 Benchmark]: Witness Printer took 118.85ms. Allocated memory is still 427.8MB. Free memory was 357.8MB in the beginning and 341.7MB in the end (delta: 16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:57:18,641 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.27ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.97ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 84.1MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.52ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 82.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.82ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 81.2MB in the end (delta: 872.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 328.15ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 65.7MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6816.77ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 65.2MB in the beginning and 357.8MB in the end (delta: -292.6MB). Peak memory consumption was 64.3kB. Max. memory is 16.1GB. * Witness Printer took 118.85ms. Allocated memory is still 427.8MB. Free memory was 357.8MB in the beginning and 341.7MB in the end (delta: 16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1009]: Data race detected Data race detected The following path leads to a data race: [L987] 0 int glob; VAL [glob=0] [L988] 0 pthread_mutex_t *p, *q; VAL [glob=0, p={0:0}, q={0:0}] [L996] 0 pthread_t t1, t2; VAL [glob=0, p={0:0}, q={0:0}] [L997] 0 int i; VAL [glob=0, p={0:0}, q={0:0}] [L998] 0 pthread_mutex_t *a; VAL [glob=0, p={0:0}, q={0:0}] [L999] 0 i=0 VAL [glob=0, i=0, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-2:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-3:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L999] 0 i++ VAL [a={-4:0}, glob=0, i=3, p={0:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1002] COND TRUE 0 i==3 VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L1003] 0 p = a VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-5:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-6:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-7:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L999] 0 i++ VAL [a={-8:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1004] COND TRUE 0 i==7 VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L1005] 0 q = a VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-9:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-10:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1002] COND FALSE 0 !(i==3) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L1004] COND FALSE 0 !(i==7) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L999] 0 i++ VAL [a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}] [L999] COND FALSE 0 !(i < 10) VAL [glob=0, p={-5:0}, q={-9:0}] [L1007] FCALL, FORK 0 pthread_create(&t1, 0, f, 0) VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L990] 1 pthread_mutex_lock(q) VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L1008] 0 pthread_mutex_lock(p) VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\old(x)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] [L991] 1 glob++ VAL [\old(x)={0:0}, glob=1, p={-5:0}, q={-9:0}, x={0:0}] [L1009] 0 glob++ VAL [\old(x)={0:0}, a={-11:0}, glob=1, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] Now there is a data race on ~glob~0 between C: glob++ [991] and C: glob++ [1009] - UnprovableResult [Line: 990]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 992]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 116 edges, 15 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: 6.7s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 102 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 903 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=13, InterpolantAutomatonStates: 101, 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, 1.6s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2823 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1596 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:18,656 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)