./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/weaver/chl-exp-term-symm.wvr.c -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 a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:23:04,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:23:04,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:23:04,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:23:04,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:23:04,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:23:04,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:23:04,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:23:04,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:23:04,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:23:04,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:23:04,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:23:04,554 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:23:04,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:23:04,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:23:04,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:04,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:23:04,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:23:04,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:23:04,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:23:04,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:23:04,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:23:04,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:23:04,557 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 -> a6cef8f51d4b8dff634e07872101a48e47fb1f63ea17b45a5f4511bf6a262ddb [2025-03-13 22:23:04,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:23:04,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:23:04,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:23:04,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:23:04,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:23:04,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2025-03-13 22:23:05,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b3754d9/2a0297cd1c9048bf83649b4609a7518c/FLAGd4957e9f0 [2025-03-13 22:23:06,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:23:06,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-symm.wvr.c [2025-03-13 22:23:06,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b3754d9/2a0297cd1c9048bf83649b4609a7518c/FLAGd4957e9f0 [2025-03-13 22:23:06,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b3754d9/2a0297cd1c9048bf83649b4609a7518c [2025-03-13 22:23:06,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:23:06,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:23:06,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:06,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:23:06,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:23:06,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8cba8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06, skipping insertion in model container [2025-03-13 22:23:06,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:23:06,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:06,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:23:06,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:06,712 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:23:06,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06 WrapperNode [2025-03-13 22:23:06,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:06,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:06,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:23:06,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:23:06,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,755 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 237 [2025-03-13 22:23:06,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:06,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:23:06,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:23:06,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:23:06,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:23:06,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:23:06,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:23:06,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:23:06,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (1/1) ... [2025-03-13 22:23:06,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:06,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:06,811 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-13 22:23:06,812 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-13 22:23:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:23:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:23:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:23:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:23:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:23:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:23:06,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:23:06,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:23:06,829 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:23:06,901 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:23:06,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:23:07,209 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:23:07,210 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:23:07,210 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:23:07,228 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:23:07,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:07 BoogieIcfgContainer [2025-03-13 22:23:07,231 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:23:07,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:23:07,233 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:23:07,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:23:07,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:23:06" (1/3) ... [2025-03-13 22:23:07,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:07, skipping insertion in model container [2025-03-13 22:23:07,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:06" (2/3) ... [2025-03-13 22:23:07,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1a70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:07, skipping insertion in model container [2025-03-13 22:23:07,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:07" (3/3) ... [2025-03-13 22:23:07,237 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-symm.wvr.c [2025-03-13 22:23:07,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:23:07,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-symm.wvr.c that has 3 procedures, 304 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2025-03-13 22:23:07,250 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:23:07,358 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:23:07,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 325 transitions, 664 flow [2025-03-13 22:23:07,478 INFO L124 PetriNetUnfolderBase]: 22/323 cut-off events. [2025-03-13 22:23:07,483 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:23:07,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 323 events. 22/323 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 790 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2025-03-13 22:23:07,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 325 transitions, 664 flow [2025-03-13 22:23:07,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 303 transitions, 618 flow [2025-03-13 22:23:07,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:23:07,519 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;@4554b1d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:23:07,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-03-13 22:23:07,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:23:07,527 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-13 22:23:07,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:23:07,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:07,529 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] [2025-03-13 22:23:07,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 340526642, now seen corresponding path program 1 times [2025-03-13 22:23:07,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:07,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724920184] [2025-03-13 22:23:07,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 22:23:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 22:23:07,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:07,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:07,668 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-13 22:23:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724920184] [2025-03-13 22:23:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724920184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262167096] [2025-03-13 22:23:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:07,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:07,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:07,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 325 [2025-03-13 22:23:07,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 303 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-13 22:23:07,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:07,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 325 [2025-03-13 22:23:07,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:07,863 INFO L124 PetriNetUnfolderBase]: 39/568 cut-off events. [2025-03-13 22:23:07,863 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-03-13 22:23:07,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 568 events. 39/568 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2592 event pairs, 8 based on Foata normal form. 16/482 useless extension candidates. Maximal degree in co-relation 419. Up to 30 conditions per place. [2025-03-13 22:23:07,869 INFO L140 encePairwiseOnDemand]: 316/325 looper letters, 11 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2025-03-13 22:23:07,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 296 transitions, 630 flow [2025-03-13 22:23:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-03-13 22:23:07,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2025-03-13 22:23:07,887 INFO L175 Difference]: Start difference. First operand has 290 places, 303 transitions, 618 flow. Second operand 3 states and 926 transitions. [2025-03-13 22:23:07,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 296 transitions, 630 flow [2025-03-13 22:23:07,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 296 transitions, 622 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:23:07,898 INFO L231 Difference]: Finished difference. Result has 287 places, 294 transitions, 596 flow [2025-03-13 22:23:07,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=287, PETRI_TRANSITIONS=294} [2025-03-13 22:23:07,904 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -3 predicate places. [2025-03-13 22:23:07,905 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 294 transitions, 596 flow [2025-03-13 22:23:07,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-13 22:23:07,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:07,906 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-13 22:23:07,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:23:07,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:07,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:07,907 INFO L85 PathProgramCache]: Analyzing trace with hash -363715190, now seen corresponding path program 1 times [2025-03-13 22:23:07,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:07,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926159902] [2025-03-13 22:23:07,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:07,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:07,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:23:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:23:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:07,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:07,968 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-13 22:23:07,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:07,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926159902] [2025-03-13 22:23:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926159902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:07,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:07,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:07,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392562700] [2025-03-13 22:23:07,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:07,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:07,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:07,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:07,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:08,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 325 [2025-03-13 22:23:08,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 294 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-13 22:23:08,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:08,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 325 [2025-03-13 22:23:08,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:08,066 INFO L124 PetriNetUnfolderBase]: 39/568 cut-off events. [2025-03-13 22:23:08,067 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-13 22:23:08,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 568 events. 39/568 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2543 event pairs, 8 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 578. Up to 30 conditions per place. [2025-03-13 22:23:08,070 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-03-13 22:23:08,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 293 transitions, 620 flow [2025-03-13 22:23:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2025-03-13 22:23:08,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435897435897436 [2025-03-13 22:23:08,072 INFO L175 Difference]: Start difference. First operand has 287 places, 294 transitions, 596 flow. Second operand 3 states and 920 transitions. [2025-03-13 22:23:08,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 293 transitions, 620 flow [2025-03-13 22:23:08,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:08,080 INFO L231 Difference]: Finished difference. Result has 284 places, 293 transitions, 594 flow [2025-03-13 22:23:08,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=284, PETRI_TRANSITIONS=293} [2025-03-13 22:23:08,082 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -6 predicate places. [2025-03-13 22:23:08,083 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 293 transitions, 594 flow [2025-03-13 22:23:08,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-13 22:23:08,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:08,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:08,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:23:08,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:08,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:08,085 INFO L85 PathProgramCache]: Analyzing trace with hash -364654698, now seen corresponding path program 1 times [2025-03-13 22:23:08,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:08,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388257064] [2025-03-13 22:23:08,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:08,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 22:23:08,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 22:23:08,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:08,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:08,130 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-13 22:23:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388257064] [2025-03-13 22:23:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388257064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:08,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:08,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117269969] [2025-03-13 22:23:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:08,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:08,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:08,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-03-13 22:23:08,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 293 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:08,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:08,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-03-13 22:23:08,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:08,232 INFO L124 PetriNetUnfolderBase]: 53/682 cut-off events. [2025-03-13 22:23:08,233 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:23:08,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 682 events. 53/682 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3647 event pairs, 15 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 699. Up to 44 conditions per place. [2025-03-13 22:23:08,238 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-03-13 22:23:08,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 292 transitions, 622 flow [2025-03-13 22:23:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-03-13 22:23:08,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2025-03-13 22:23:08,242 INFO L175 Difference]: Start difference. First operand has 284 places, 293 transitions, 594 flow. Second operand 3 states and 916 transitions. [2025-03-13 22:23:08,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 292 transitions, 622 flow [2025-03-13 22:23:08,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 292 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:08,249 INFO L231 Difference]: Finished difference. Result has 283 places, 292 transitions, 592 flow [2025-03-13 22:23:08,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=283, PETRI_TRANSITIONS=292} [2025-03-13 22:23:08,250 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -7 predicate places. [2025-03-13 22:23:08,250 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 292 transitions, 592 flow [2025-03-13 22:23:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:08,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:08,251 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-13 22:23:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:23:08,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -456187454, now seen corresponding path program 1 times [2025-03-13 22:23:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778982828] [2025-03-13 22:23:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:08,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:23:08,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:23:08,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:08,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:08,318 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-13 22:23:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778982828] [2025-03-13 22:23:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778982828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:08,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151339131] [2025-03-13 22:23:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:08,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:08,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:08,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-03-13 22:23:08,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 292 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:08,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:08,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-03-13 22:23:08,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:08,462 INFO L124 PetriNetUnfolderBase]: 53/669 cut-off events. [2025-03-13 22:23:08,463 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:23:08,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 669 events. 53/669 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3640 event pairs, 15 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 678. Up to 44 conditions per place. [2025-03-13 22:23:08,469 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-13 22:23:08,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 291 transitions, 620 flow [2025-03-13 22:23:08,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-03-13 22:23:08,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2025-03-13 22:23:08,472 INFO L175 Difference]: Start difference. First operand has 283 places, 292 transitions, 592 flow. Second operand 3 states and 916 transitions. [2025-03-13 22:23:08,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 291 transitions, 620 flow [2025-03-13 22:23:08,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:08,477 INFO L231 Difference]: Finished difference. Result has 282 places, 291 transitions, 590 flow [2025-03-13 22:23:08,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=282, PETRI_TRANSITIONS=291} [2025-03-13 22:23:08,479 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2025-03-13 22:23:08,479 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 291 transitions, 590 flow [2025-03-13 22:23:08,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:08,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:08,480 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:23:08,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1805785107, now seen corresponding path program 1 times [2025-03-13 22:23:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522729836] [2025-03-13 22:23:08,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:08,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:23:08,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:23:08,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:08,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:08,553 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-13 22:23:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522729836] [2025-03-13 22:23:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522729836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:08,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113324546] [2025-03-13 22:23:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:08,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:08,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:08,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:08,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 325 [2025-03-13 22:23:08,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-13 22:23:08,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:08,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 325 [2025-03-13 22:23:08,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:08,678 INFO L124 PetriNetUnfolderBase]: 116/1116 cut-off events. [2025-03-13 22:23:08,678 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 22:23:08,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1116 events. 116/1116 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7548 event pairs, 36 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 1188. Up to 110 conditions per place. [2025-03-13 22:23:08,685 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 18 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-13 22:23:08,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 288 transitions, 625 flow [2025-03-13 22:23:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-03-13 22:23:08,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9312820512820513 [2025-03-13 22:23:08,688 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 590 flow. Second operand 3 states and 908 transitions. [2025-03-13 22:23:08,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 288 transitions, 625 flow [2025-03-13 22:23:08,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 288 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:08,692 INFO L231 Difference]: Finished difference. Result has 277 places, 287 transitions, 588 flow [2025-03-13 22:23:08,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=277, PETRI_TRANSITIONS=287} [2025-03-13 22:23:08,693 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2025-03-13 22:23:08,693 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 287 transitions, 588 flow [2025-03-13 22:23:08,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-13 22:23:08,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:08,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:08,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:23:08,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:08,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 192720180, now seen corresponding path program 1 times [2025-03-13 22:23:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:08,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490319933] [2025-03-13 22:23:08,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:08,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:23:08,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:23:08,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:08,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:08,760 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-13 22:23:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490319933] [2025-03-13 22:23:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490319933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927223088] [2025-03-13 22:23:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:08,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:08,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:08,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 325 [2025-03-13 22:23:08,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 287 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-13 22:23:08,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:08,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 325 [2025-03-13 22:23:08,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:08,887 INFO L124 PetriNetUnfolderBase]: 145/1395 cut-off events. [2025-03-13 22:23:08,887 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:23:08,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1548 conditions, 1395 events. 145/1395 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10376 event pairs, 36 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1393. Up to 128 conditions per place. [2025-03-13 22:23:08,895 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 18 selfloop transitions, 2 changer transitions 0/284 dead transitions. [2025-03-13 22:23:08,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 284 transitions, 623 flow [2025-03-13 22:23:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2025-03-13 22:23:08,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9312820512820513 [2025-03-13 22:23:08,898 INFO L175 Difference]: Start difference. First operand has 277 places, 287 transitions, 588 flow. Second operand 3 states and 908 transitions. [2025-03-13 22:23:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 284 transitions, 623 flow [2025-03-13 22:23:08,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 284 transitions, 623 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:08,901 INFO L231 Difference]: Finished difference. Result has 274 places, 283 transitions, 590 flow [2025-03-13 22:23:08,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=274, PETRI_TRANSITIONS=283} [2025-03-13 22:23:08,902 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -16 predicate places. [2025-03-13 22:23:08,902 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 283 transitions, 590 flow [2025-03-13 22:23:08,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-13 22:23:08,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:08,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:08,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:23:08,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:08,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:08,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1290659334, now seen corresponding path program 1 times [2025-03-13 22:23:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796156282] [2025-03-13 22:23:08,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:08,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:23:08,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:23:08,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:08,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:08,955 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-13 22:23:08,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:08,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796156282] [2025-03-13 22:23:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796156282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:08,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:23:08,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370231714] [2025-03-13 22:23:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:08,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:08,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:08,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:08,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2025-03-13 22:23:08,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 283 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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-13 22:23:08,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:08,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2025-03-13 22:23:08,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:09,040 INFO L124 PetriNetUnfolderBase]: 47/651 cut-off events. [2025-03-13 22:23:09,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:23:09,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 651 events. 47/651 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3606 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 557. Up to 22 conditions per place. [2025-03-13 22:23:09,047 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2025-03-13 22:23:09,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 286 transitions, 625 flow [2025-03-13 22:23:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2025-03-13 22:23:09,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569230769230769 [2025-03-13 22:23:09,050 INFO L175 Difference]: Start difference. First operand has 274 places, 283 transitions, 590 flow. Second operand 3 states and 933 transitions. [2025-03-13 22:23:09,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 286 transitions, 625 flow [2025-03-13 22:23:09,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:09,056 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 612 flow [2025-03-13 22:23:09,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2025-03-13 22:23:09,058 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2025-03-13 22:23:09,058 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 612 flow [2025-03-13 22:23:09,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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-13 22:23:09,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:09,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:23:09,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1632157959, now seen corresponding path program 1 times [2025-03-13 22:23:09,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825996648] [2025-03-13 22:23:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:09,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:23:09,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:23:09,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:09,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:09,108 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-13 22:23:09,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825996648] [2025-03-13 22:23:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825996648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:09,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:09,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425546235] [2025-03-13 22:23:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:09,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:09,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:09,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:09,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:09,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-03-13 22:23:09,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:09,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:09,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-03-13 22:23:09,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:09,242 INFO L124 PetriNetUnfolderBase]: 103/1220 cut-off events. [2025-03-13 22:23:09,243 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-03-13 22:23:09,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1220 events. 103/1220 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8293 event pairs, 8 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1178. Up to 87 conditions per place. [2025-03-13 22:23:09,250 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 16 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2025-03-13 22:23:09,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 288 transitions, 661 flow [2025-03-13 22:23:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-13 22:23:09,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-03-13 22:23:09,253 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 612 flow. Second operand 3 states and 924 transitions. [2025-03-13 22:23:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 288 transitions, 661 flow [2025-03-13 22:23:09,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 288 transitions, 655 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:09,259 INFO L231 Difference]: Finished difference. Result has 275 places, 285 transitions, 626 flow [2025-03-13 22:23:09,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=275, PETRI_TRANSITIONS=285} [2025-03-13 22:23:09,261 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2025-03-13 22:23:09,261 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 285 transitions, 626 flow [2025-03-13 22:23:09,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:09,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:09,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:09,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:09,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:09,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash -533656013, now seen corresponding path program 1 times [2025-03-13 22:23:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555377428] [2025-03-13 22:23:09,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:09,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:23:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:23:09,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:09,325 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-13 22:23:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:09,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555377428] [2025-03-13 22:23:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555377428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:09,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9511341] [2025-03-13 22:23:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:09,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:09,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:09,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:09,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 325 [2025-03-13 22:23:09,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-13 22:23:09,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:09,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 325 [2025-03-13 22:23:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:09,440 INFO L124 PetriNetUnfolderBase]: 93/1123 cut-off events. [2025-03-13 22:23:09,440 INFO L125 PetriNetUnfolderBase]: For 5/17 co-relation queries the response was YES. [2025-03-13 22:23:09,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1123 events. 93/1123 cut-off events. For 5/17 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7387 event pairs, 6 based on Foata normal form. 3/992 useless extension candidates. Maximal degree in co-relation 1088. Up to 32 conditions per place. [2025-03-13 22:23:09,447 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-13 22:23:09,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 285 transitions, 651 flow [2025-03-13 22:23:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-03-13 22:23:09,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-03-13 22:23:09,449 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 626 flow. Second operand 3 states and 928 transitions. [2025-03-13 22:23:09,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 285 transitions, 651 flow [2025-03-13 22:23:09,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 285 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:09,452 INFO L231 Difference]: Finished difference. Result has 276 places, 284 transitions, 628 flow [2025-03-13 22:23:09,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=276, PETRI_TRANSITIONS=284} [2025-03-13 22:23:09,453 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -14 predicate places. [2025-03-13 22:23:09,453 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 284 transitions, 628 flow [2025-03-13 22:23:09,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-13 22:23:09,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:09,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:23:09,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:09,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash 840757004, now seen corresponding path program 1 times [2025-03-13 22:23:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723831656] [2025-03-13 22:23:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:09,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-13 22:23:09,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-13 22:23:09,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:09,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:09,483 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-13 22:23:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723831656] [2025-03-13 22:23:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723831656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:09,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894619384] [2025-03-13 22:23:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:09,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:09,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:09,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-03-13 22:23:09,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 284 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:09,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:09,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-03-13 22:23:09,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:09,603 INFO L124 PetriNetUnfolderBase]: 123/1336 cut-off events. [2025-03-13 22:23:09,603 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-03-13 22:23:09,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1336 events. 123/1336 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9677 event pairs, 14 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 1358. Up to 100 conditions per place. [2025-03-13 22:23:09,612 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 16 selfloop transitions, 4 changer transitions 0/287 dead transitions. [2025-03-13 22:23:09,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 287 transitions, 677 flow [2025-03-13 22:23:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-13 22:23:09,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-03-13 22:23:09,614 INFO L175 Difference]: Start difference. First operand has 276 places, 284 transitions, 628 flow. Second operand 3 states and 924 transitions. [2025-03-13 22:23:09,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 287 transitions, 677 flow [2025-03-13 22:23:09,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 287 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:09,619 INFO L231 Difference]: Finished difference. Result has 273 places, 284 transitions, 644 flow [2025-03-13 22:23:09,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=273, PETRI_TRANSITIONS=284} [2025-03-13 22:23:09,620 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -17 predicate places. [2025-03-13 22:23:09,620 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 284 transitions, 644 flow [2025-03-13 22:23:09,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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-13 22:23:09,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:09,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:09,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:23:09,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:09,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1151688171, now seen corresponding path program 1 times [2025-03-13 22:23:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:09,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215826669] [2025-03-13 22:23:09,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:09,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:23:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:23:09,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:09,650 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-13 22:23:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215826669] [2025-03-13 22:23:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215826669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:09,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:23:09,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496025053] [2025-03-13 22:23:09,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:09,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:09,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:09,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2025-03-13 22:23:09,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 284 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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-13 22:23:09,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:09,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2025-03-13 22:23:09,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:09,742 INFO L124 PetriNetUnfolderBase]: 104/1158 cut-off events. [2025-03-13 22:23:09,742 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-13 22:23:09,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 1158 events. 104/1158 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7723 event pairs, 10 based on Foata normal form. 0/1026 useless extension candidates. Maximal degree in co-relation 1159. Up to 81 conditions per place. [2025-03-13 22:23:09,749 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 11 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2025-03-13 22:23:09,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 287 transitions, 679 flow [2025-03-13 22:23:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2025-03-13 22:23:09,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569230769230769 [2025-03-13 22:23:09,750 INFO L175 Difference]: Start difference. First operand has 273 places, 284 transitions, 644 flow. Second operand 3 states and 933 transitions. [2025-03-13 22:23:09,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 287 transitions, 679 flow [2025-03-13 22:23:09,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 287 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:09,754 INFO L231 Difference]: Finished difference. Result has 277 places, 286 transitions, 666 flow [2025-03-13 22:23:09,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=277, PETRI_TRANSITIONS=286} [2025-03-13 22:23:09,754 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2025-03-13 22:23:09,754 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 286 transitions, 666 flow [2025-03-13 22:23:09,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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-13 22:23:09,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:09,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:09,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:23:09,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1105386600, now seen corresponding path program 1 times [2025-03-13 22:23:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885922242] [2025-03-13 22:23:09,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:09,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 22:23:09,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 22:23:09,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:09,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:09,791 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-13 22:23:09,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:09,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885922242] [2025-03-13 22:23:09,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885922242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:09,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:09,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:09,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005202089] [2025-03-13 22:23:09,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:09,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:09,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:09,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:09,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:09,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 325 [2025-03-13 22:23:09,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 286 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 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-13 22:23:09,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:09,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 325 [2025-03-13 22:23:09,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:09,925 INFO L124 PetriNetUnfolderBase]: 104/1036 cut-off events. [2025-03-13 22:23:09,926 INFO L125 PetriNetUnfolderBase]: For 56/58 co-relation queries the response was YES. [2025-03-13 22:23:09,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1036 events. 104/1036 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6705 event pairs, 6 based on Foata normal form. 0/952 useless extension candidates. Maximal degree in co-relation 1109. Up to 65 conditions per place. [2025-03-13 22:23:09,932 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2025-03-13 22:23:09,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 286 transitions, 691 flow [2025-03-13 22:23:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-03-13 22:23:09,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-03-13 22:23:09,934 INFO L175 Difference]: Start difference. First operand has 277 places, 286 transitions, 666 flow. Second operand 3 states and 928 transitions. [2025-03-13 22:23:09,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 286 transitions, 691 flow [2025-03-13 22:23:09,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 286 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:09,939 INFO L231 Difference]: Finished difference. Result has 276 places, 285 transitions, 662 flow [2025-03-13 22:23:09,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=276, PETRI_TRANSITIONS=285} [2025-03-13 22:23:09,940 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -14 predicate places. [2025-03-13 22:23:09,940 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 285 transitions, 662 flow [2025-03-13 22:23:09,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 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-13 22:23:09,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:09,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:09,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:23:09,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -523222357, now seen corresponding path program 1 times [2025-03-13 22:23:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:09,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131860373] [2025-03-13 22:23:09,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:09,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:09,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-13 22:23:09,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-13 22:23:09,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:09,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:10,004 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-13 22:23:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:10,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131860373] [2025-03-13 22:23:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131860373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085629377] [2025-03-13 22:23:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:10,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:10,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:10,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:10,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-13 22:23:10,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 285 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-13 22:23:10,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:10,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-13 22:23:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:10,101 INFO L124 PetriNetUnfolderBase]: 99/1287 cut-off events. [2025-03-13 22:23:10,102 INFO L125 PetriNetUnfolderBase]: For 5/10 co-relation queries the response was YES. [2025-03-13 22:23:10,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1287 events. 99/1287 cut-off events. For 5/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9019 event pairs, 4 based on Foata normal form. 0/1185 useless extension candidates. Maximal degree in co-relation 1349. Up to 43 conditions per place. [2025-03-13 22:23:10,109 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2025-03-13 22:23:10,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 282 transitions, 678 flow [2025-03-13 22:23:10,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2025-03-13 22:23:10,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9466666666666667 [2025-03-13 22:23:10,111 INFO L175 Difference]: Start difference. First operand has 276 places, 285 transitions, 662 flow. Second operand 3 states and 923 transitions. [2025-03-13 22:23:10,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 282 transitions, 678 flow [2025-03-13 22:23:10,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 282 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:10,115 INFO L231 Difference]: Finished difference. Result has 273 places, 282 transitions, 654 flow [2025-03-13 22:23:10,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=273, PETRI_TRANSITIONS=282} [2025-03-13 22:23:10,116 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -17 predicate places. [2025-03-13 22:23:10,116 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 282 transitions, 654 flow [2025-03-13 22:23:10,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-13 22:23:10,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:10,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:23:10,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:23:10,117 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-03-13 22:23:10,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash 153462479, now seen corresponding path program 1 times [2025-03-13 22:23:10,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:10,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520372473] [2025-03-13 22:23:10,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:10,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:10,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:23:10,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:23:10,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:10,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:10,158 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-13 22:23:10,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:10,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520372473] [2025-03-13 22:23:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520372473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142883759] [2025-03-13 22:23:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:10,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:10,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:10,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:10,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-03-13 22:23:10,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 282 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-13 22:23:10,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:10,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-03-13 22:23:10,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:10,241 INFO L124 PetriNetUnfolderBase]: 86/1049 cut-off events. [2025-03-13 22:23:10,242 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-03-13 22:23:10,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 1049 events. 86/1049 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6374 event pairs, 4 based on Foata normal form. 2/970 useless extension candidates. Maximal degree in co-relation 1120. Up to 44 conditions per place. [2025-03-13 22:23:10,247 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2025-03-13 22:23:10,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 281 transitions, 676 flow [2025-03-13 22:23:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-13 22:23:10,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-03-13 22:23:10,249 INFO L175 Difference]: Start difference. First operand has 273 places, 282 transitions, 654 flow. Second operand 3 states and 924 transitions. [2025-03-13 22:23:10,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 281 transitions, 676 flow [2025-03-13 22:23:10,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 281 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:10,252 INFO L231 Difference]: Finished difference. Result has 271 places, 0 transitions, 0 flow [2025-03-13 22:23:10,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=271, PETRI_TRANSITIONS=0} [2025-03-13 22:23:10,252 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -19 predicate places. [2025-03-13 22:23:10,252 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 0 transitions, 0 flow [2025-03-13 22:23:10,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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-13 22:23:10,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (55 of 56 remaining) [2025-03-13 22:23:10,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (54 of 56 remaining) [2025-03-13 22:23:10,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (53 of 56 remaining) [2025-03-13 22:23:10,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (52 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (49 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (43 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (42 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 56 remaining) [2025-03-13 22:23:10,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 56 remaining) [2025-03-13 22:23:10,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 56 remaining) [2025-03-13 22:23:10,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 56 remaining) [2025-03-13 22:23:10,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 56 remaining) [2025-03-13 22:23:10,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 56 remaining) [2025-03-13 22:23:10,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (17 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 56 remaining) [2025-03-13 22:23:10,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 56 remaining) [2025-03-13 22:23:10,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 56 remaining) [2025-03-13 22:23:10,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:23:10,260 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:10,265 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:23:10,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:23:10,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:23:10 BasicIcfg [2025-03-13 22:23:10,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:23:10,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:23:10,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:23:10,272 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:23:10,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:07" (3/4) ... [2025-03-13 22:23:10,273 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:23:10,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:23:10,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:23:10,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-13 22:23:10,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:23:10,280 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:23:10,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:23:10,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:23:10,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:23:10,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:23:10,342 INFO L158 Benchmark]: Toolchain (without parser) took 3835.73ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 159.1MB in the beginning and 166.5MB in the end (delta: -7.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-03-13 22:23:10,342 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:10,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.13ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 146.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:10,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.24ms. Allocated memory is still 201.3MB. Free memory was 146.9MB in the beginning and 144.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:10,342 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 144.1MB in the end (delta: 764.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:23:10,343 INFO L158 Benchmark]: IcfgBuilder took 448.65ms. Allocated memory is still 201.3MB. Free memory was 143.7MB in the beginning and 120.5MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:23:10,343 INFO L158 Benchmark]: TraceAbstraction took 3038.83ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 120.1MB in the beginning and 174.3MB in the end (delta: -54.2MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2025-03-13 22:23:10,343 INFO L158 Benchmark]: Witness Printer took 69.73ms. Allocated memory is still 243.3MB. Free memory was 174.3MB in the beginning and 166.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:23:10,344 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.80ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.13ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 146.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.24ms. Allocated memory is still 201.3MB. Free memory was 146.9MB in the beginning and 144.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 144.1MB in the end (delta: 764.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 448.65ms. Allocated memory is still 201.3MB. Free memory was 143.7MB in the beginning and 120.5MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3038.83ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 120.1MB in the beginning and 174.3MB in the end (delta: -54.2MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Witness Printer took 69.73ms. Allocated memory is still 243.3MB. Free memory was 174.3MB in the beginning and 166.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 484 locations, 56 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 119 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=666occurred in iteration=11, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 890 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:23:10,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE