./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-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 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:51,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:52,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:52,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:52,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:52,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:52,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:52,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:52,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:52,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:52,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:52,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:52,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:52,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:52,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:52,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:52,052 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 -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2025-03-08 22:04:52,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:52,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:52,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:52,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:52,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:52,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2025-03-08 22:04:53,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bbb9eef/9a6080a30d8d4cf09434bbd99ecf7edb/FLAG463aa1775 [2025-03-08 22:04:53,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:53,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2025-03-08 22:04:53,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bbb9eef/9a6080a30d8d4cf09434bbd99ecf7edb/FLAG463aa1775 [2025-03-08 22:04:53,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bbb9eef/9a6080a30d8d4cf09434bbd99ecf7edb [2025-03-08 22:04:53,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:53,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:53,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:53,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:53,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:53,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6c7faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53, skipping insertion in model container [2025-03-08 22:04:53,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:53,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:53,851 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:53,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:53,886 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:53,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53 WrapperNode [2025-03-08 22:04:53,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:53,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:53,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:53,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:53,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,927 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 241 [2025-03-08 22:04:53,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:53,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:53,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:53,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:53,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:53,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:53,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:53,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:53,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (1/1) ... [2025-03-08 22:04:53,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:53,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:53,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:04:53,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:04:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:53,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:53,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:53,999 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:04:54,073 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:54,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:04:54,392 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:04:54,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:04:54,404 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:04:54,404 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:04:54,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:54 BoogieIcfgContainer [2025-03-08 22:04:54,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:04:54,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:04:54,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:04:54,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:04:54,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:53" (1/3) ... [2025-03-08 22:04:54,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b77d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:54, skipping insertion in model container [2025-03-08 22:04:54,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:53" (2/3) ... [2025-03-08 22:04:54,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b77d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:54, skipping insertion in model container [2025-03-08 22:04:54,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:54" (3/3) ... [2025-03-08 22:04:54,414 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2025-03-08 22:04:54,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:04:54,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-symm.wvr.c that has 3 procedures, 326 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-08 22:04:54,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:04:54,517 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:04:54,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 341 transitions, 696 flow [2025-03-08 22:04:54,645 INFO L124 PetriNetUnfolderBase]: 16/339 cut-off events. [2025-03-08 22:04:54,647 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:04:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 339 events. 16/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 365 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2025-03-08 22:04:54,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 341 transitions, 696 flow [2025-03-08 22:04:54,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 319 transitions, 650 flow [2025-03-08 22:04:54,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:04:54,677 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;@27829286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:04:54,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-08 22:04:54,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:04:54,682 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-08 22:04:54,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:04:54,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:54,682 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] [2025-03-08 22:04:54,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:54,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -841080367, now seen corresponding path program 1 times [2025-03-08 22:04:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:54,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347650630] [2025-03-08 22:04:54,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:54,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 22:04:54,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:04:54,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:54,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:54,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347650630] [2025-03-08 22:04:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347650630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:54,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866818256] [2025-03-08 22:04:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:54,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:54,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:54,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2025-03-08 22:04:54,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:54,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:54,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2025-03-08 22:04:54,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,034 INFO L124 PetriNetUnfolderBase]: 14/504 cut-off events. [2025-03-08 22:04:55,034 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2025-03-08 22:04:55,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 504 events. 14/504 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1236 event pairs, 8 based on Foata normal form. 27/459 useless extension candidates. Maximal degree in co-relation 403. Up to 28 conditions per place. [2025-03-08 22:04:55,040 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 11 selfloop transitions, 2 changer transitions 2/308 dead transitions. [2025-03-08 22:04:55,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 654 flow [2025-03-08 22:04:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-08 22:04:55,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9442815249266863 [2025-03-08 22:04:55,056 INFO L175 Difference]: Start difference. First operand has 312 places, 319 transitions, 650 flow. Second operand 3 states and 966 transitions. [2025-03-08 22:04:55,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 654 flow [2025-03-08 22:04:55,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:04:55,065 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 620 flow [2025-03-08 22:04:55,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2025-03-08 22:04:55,070 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -3 predicate places. [2025-03-08 22:04:55,071 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 620 flow [2025-03-08 22:04:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,073 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] [2025-03-08 22:04:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:04:55,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1467583853, now seen corresponding path program 1 times [2025-03-08 22:04:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816828285] [2025-03-08 22:04:55,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:04:55,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:04:55,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816828285] [2025-03-08 22:04:55,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816828285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146423745] [2025-03-08 22:04:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2025-03-08 22:04:55,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2025-03-08 22:04:55,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,200 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2025-03-08 22:04:55,200 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:04:55,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1151 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 480. Up to 16 conditions per place. [2025-03-08 22:04:55,203 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-03-08 22:04:55,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 305 transitions, 640 flow [2025-03-08 22:04:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-08 22:04:55,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2025-03-08 22:04:55,206 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 620 flow. Second operand 3 states and 960 transitions. [2025-03-08 22:04:55,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 305 transitions, 640 flow [2025-03-08 22:04:55,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,212 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 618 flow [2025-03-08 22:04:55,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2025-03-08 22:04:55,214 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -6 predicate places. [2025-03-08 22:04:55,214 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 618 flow [2025-03-08 22:04:55,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:55,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:04:55,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2102573185, now seen corresponding path program 1 times [2025-03-08 22:04:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268725983] [2025-03-08 22:04:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:04:55,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:04:55,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268725983] [2025-03-08 22:04:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268725983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005578355] [2025-03-08 22:04:55,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2025-03-08 22:04:55,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2025-03-08 22:04:55,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,351 INFO L124 PetriNetUnfolderBase]: 9/480 cut-off events. [2025-03-08 22:04:55,352 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:04:55,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 480 events. 9/480 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1112 event pairs, 3 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 465. Up to 16 conditions per place. [2025-03-08 22:04:55,355 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-08 22:04:55,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 638 flow [2025-03-08 22:04:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-08 22:04:55,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2025-03-08 22:04:55,357 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 618 flow. Second operand 3 states and 960 transitions. [2025-03-08 22:04:55,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 638 flow [2025-03-08 22:04:55,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 304 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,361 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 616 flow [2025-03-08 22:04:55,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2025-03-08 22:04:55,363 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -7 predicate places. [2025-03-08 22:04:55,363 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 616 flow [2025-03-08 22:04:55,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,364 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] [2025-03-08 22:04:55,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:04:55,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash 642549618, now seen corresponding path program 1 times [2025-03-08 22:04:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885193674] [2025-03-08 22:04:55,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:04:55,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:04:55,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885193674] [2025-03-08 22:04:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885193674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402100208] [2025-03-08 22:04:55,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2025-03-08 22:04:55,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2025-03-08 22:04:55,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,526 INFO L124 PetriNetUnfolderBase]: 14/499 cut-off events. [2025-03-08 22:04:55,526 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:04:55,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 499 events. 14/499 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1226 event pairs, 8 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 489. Up to 28 conditions per place. [2025-03-08 22:04:55,530 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 11 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-03-08 22:04:55,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 640 flow [2025-03-08 22:04:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-08 22:04:55,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2025-03-08 22:04:55,532 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 616 flow. Second operand 3 states and 956 transitions. [2025-03-08 22:04:55,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 640 flow [2025-03-08 22:04:55,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,537 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 614 flow [2025-03-08 22:04:55,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2025-03-08 22:04:55,538 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-08 22:04:55,538 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 614 flow [2025-03-08 22:04:55,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,539 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] [2025-03-08 22:04:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:04:55,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2002141854, now seen corresponding path program 1 times [2025-03-08 22:04:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23377715] [2025-03-08 22:04:55,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 22:04:55,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 22:04:55,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23377715] [2025-03-08 22:04:55,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23377715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708351240] [2025-03-08 22:04:55,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2025-03-08 22:04:55,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2025-03-08 22:04:55,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,671 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2025-03-08 22:04:55,671 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:04:55,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 798 event pairs, 3 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 456. Up to 16 conditions per place. [2025-03-08 22:04:55,675 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-08 22:04:55,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 634 flow [2025-03-08 22:04:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-08 22:04:55,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2025-03-08 22:04:55,677 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 614 flow. Second operand 3 states and 960 transitions. [2025-03-08 22:04:55,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 634 flow [2025-03-08 22:04:55,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,681 INFO L231 Difference]: Finished difference. Result has 303 places, 302 transitions, 612 flow [2025-03-08 22:04:55,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=303, PETRI_TRANSITIONS=302} [2025-03-08 22:04:55,682 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2025-03-08 22:04:55,682 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 302 transitions, 612 flow [2025-03-08 22:04:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,683 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] [2025-03-08 22:04:55,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:04:55,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash 341244655, now seen corresponding path program 1 times [2025-03-08 22:04:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35481411] [2025-03-08 22:04:55,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:04:55,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:04:55,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35481411] [2025-03-08 22:04:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35481411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735741973] [2025-03-08 22:04:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2025-03-08 22:04:55,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2025-03-08 22:04:55,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,797 INFO L124 PetriNetUnfolderBase]: 9/483 cut-off events. [2025-03-08 22:04:55,798 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-08 22:04:55,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 483 events. 9/483 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 797 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 444. Up to 16 conditions per place. [2025-03-08 22:04:55,802 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-03-08 22:04:55,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 632 flow [2025-03-08 22:04:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-08 22:04:55,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2025-03-08 22:04:55,805 INFO L175 Difference]: Start difference. First operand has 303 places, 302 transitions, 612 flow. Second operand 3 states and 960 transitions. [2025-03-08 22:04:55,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 632 flow [2025-03-08 22:04:55,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,808 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 610 flow [2025-03-08 22:04:55,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-03-08 22:04:55,810 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-08 22:04:55,810 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 610 flow [2025-03-08 22:04:55,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,811 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] [2025-03-08 22:04:55,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:04:55,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1515262926, now seen corresponding path program 1 times [2025-03-08 22:04:55,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107548812] [2025-03-08 22:04:55,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 22:04:55,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 22:04:55,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107548812] [2025-03-08 22:04:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107548812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697593444] [2025-03-08 22:04:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:55,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:55,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:55,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:55,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2025-03-08 22:04:55,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:55,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2025-03-08 22:04:55,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:55,938 INFO L124 PetriNetUnfolderBase]: 17/649 cut-off events. [2025-03-08 22:04:55,938 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:04:55,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 649 events. 17/649 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1976 event pairs, 4 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 611. Up to 22 conditions per place. [2025-03-08 22:04:55,942 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-08 22:04:55,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 637 flow [2025-03-08 22:04:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-08 22:04:55,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2025-03-08 22:04:55,945 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 610 flow. Second operand 3 states and 968 transitions. [2025-03-08 22:04:55,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 637 flow [2025-03-08 22:04:55,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:55,949 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 616 flow [2025-03-08 22:04:55,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2025-03-08 22:04:55,951 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -11 predicate places. [2025-03-08 22:04:55,951 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 616 flow [2025-03-08 22:04:55,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:55,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:55,952 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-08 22:04:55,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:04:55,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:55,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 173779567, now seen corresponding path program 1 times [2025-03-08 22:04:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959034301] [2025-03-08 22:04:55,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:55,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 22:04:55,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 22:04:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,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-08 22:04:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959034301] [2025-03-08 22:04:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959034301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087799668] [2025-03-08 22:04:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2025-03-08 22:04:56,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2025-03-08 22:04:56,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,080 INFO L124 PetriNetUnfolderBase]: 19/725 cut-off events. [2025-03-08 22:04:56,081 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:04:56,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 725 events. 19/725 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2510 event pairs, 5 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 625. Up to 24 conditions per place. [2025-03-08 22:04:56,084 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-08 22:04:56,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 643 flow [2025-03-08 22:04:56,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-08 22:04:56,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2025-03-08 22:04:56,086 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 616 flow. Second operand 3 states and 968 transitions. [2025-03-08 22:04:56,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 643 flow [2025-03-08 22:04:56,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:56,092 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 626 flow [2025-03-08 22:04:56,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-03-08 22:04:56,093 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-08 22:04:56,093 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 626 flow [2025-03-08 22:04:56,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,094 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] [2025-03-08 22:04:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:04:56,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1653823405, now seen corresponding path program 1 times [2025-03-08 22:04:56,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502604491] [2025-03-08 22:04:56,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 22:04:56,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 22:04:56,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502604491] [2025-03-08 22:04:56,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502604491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065988846] [2025-03-08 22:04:56,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2025-03-08 22:04:56,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2025-03-08 22:04:56,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,233 INFO L124 PetriNetUnfolderBase]: 20/667 cut-off events. [2025-03-08 22:04:56,233 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-08 22:04:56,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 667 events. 20/667 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2613 event pairs, 3 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 574. Up to 22 conditions per place. [2025-03-08 22:04:56,237 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-08 22:04:56,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 653 flow [2025-03-08 22:04:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-08 22:04:56,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2025-03-08 22:04:56,239 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 626 flow. Second operand 3 states and 968 transitions. [2025-03-08 22:04:56,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 653 flow [2025-03-08 22:04:56,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:56,245 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 636 flow [2025-03-08 22:04:56,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2025-03-08 22:04:56,246 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2025-03-08 22:04:56,246 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 636 flow [2025-03-08 22:04:56,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,247 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] [2025-03-08 22:04:56,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:04:56,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,248 INFO L85 PathProgramCache]: Analyzing trace with hash 186416718, now seen corresponding path program 1 times [2025-03-08 22:04:56,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854407215] [2025-03-08 22:04:56,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 22:04:56,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:04:56,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854407215] [2025-03-08 22:04:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854407215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003221916] [2025-03-08 22:04:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2025-03-08 22:04:56,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2025-03-08 22:04:56,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,384 INFO L124 PetriNetUnfolderBase]: 22/710 cut-off events. [2025-03-08 22:04:56,384 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-08 22:04:56,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 710 events. 22/710 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2987 event pairs, 3 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 626. Up to 25 conditions per place. [2025-03-08 22:04:56,389 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-08 22:04:56,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 663 flow [2025-03-08 22:04:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-08 22:04:56,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2025-03-08 22:04:56,391 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 636 flow. Second operand 3 states and 968 transitions. [2025-03-08 22:04:56,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 663 flow [2025-03-08 22:04:56,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:56,395 INFO L231 Difference]: Finished difference. Result has 304 places, 301 transitions, 646 flow [2025-03-08 22:04:56,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=301} [2025-03-08 22:04:56,396 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2025-03-08 22:04:56,396 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 301 transitions, 646 flow [2025-03-08 22:04:56,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,397 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:04:56,397 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1729735506, now seen corresponding path program 1 times [2025-03-08 22:04:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603676719] [2025-03-08 22:04:56,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 22:04:56,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:04:56,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603676719] [2025-03-08 22:04:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603676719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591433047] [2025-03-08 22:04:56,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2025-03-08 22:04:56,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 301 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2025-03-08 22:04:56,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,540 INFO L124 PetriNetUnfolderBase]: 43/669 cut-off events. [2025-03-08 22:04:56,541 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 22:04:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 669 events. 43/669 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2600 event pairs, 16 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 642. Up to 76 conditions per place. [2025-03-08 22:04:56,545 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2025-03-08 22:04:56,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 677 flow [2025-03-08 22:04:56,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-08 22:04:56,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2025-03-08 22:04:56,547 INFO L175 Difference]: Start difference. First operand has 304 places, 301 transitions, 646 flow. Second operand 3 states and 956 transitions. [2025-03-08 22:04:56,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 677 flow [2025-03-08 22:04:56,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:56,551 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 652 flow [2025-03-08 22:04:56,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2025-03-08 22:04:56,552 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2025-03-08 22:04:56,552 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 652 flow [2025-03-08 22:04:56,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:56,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:04:56,553 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -123454513, now seen corresponding path program 1 times [2025-03-08 22:04:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503774176] [2025-03-08 22:04:56,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 22:04:56,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 22:04:56,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503774176] [2025-03-08 22:04:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503774176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303751525] [2025-03-08 22:04:56,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2025-03-08 22:04:56,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2025-03-08 22:04:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,696 INFO L124 PetriNetUnfolderBase]: 47/692 cut-off events. [2025-03-08 22:04:56,697 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:04:56,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 692 events. 47/692 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2685 event pairs, 16 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 688. Up to 81 conditions per place. [2025-03-08 22:04:56,700 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-08 22:04:56,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 298 transitions, 683 flow [2025-03-08 22:04:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2025-03-08 22:04:56,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2025-03-08 22:04:56,702 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 652 flow. Second operand 3 states and 956 transitions. [2025-03-08 22:04:56,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 298 transitions, 683 flow [2025-03-08 22:04:56,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:56,706 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 658 flow [2025-03-08 22:04:56,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2025-03-08 22:04:56,706 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-08 22:04:56,707 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 658 flow [2025-03-08 22:04:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:56,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:04:56,708 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash -951791241, now seen corresponding path program 1 times [2025-03-08 22:04:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711176401] [2025-03-08 22:04:56,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 22:04:56,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 22:04:56,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711176401] [2025-03-08 22:04:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711176401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218238992] [2025-03-08 22:04:56,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2025-03-08 22:04:56,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2025-03-08 22:04:56,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,800 INFO L124 PetriNetUnfolderBase]: 21/545 cut-off events. [2025-03-08 22:04:56,800 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2025-03-08 22:04:56,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 545 events. 21/545 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1772 event pairs, 2 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 501. Up to 20 conditions per place. [2025-03-08 22:04:56,803 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2025-03-08 22:04:56,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 683 flow [2025-03-08 22:04:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-08 22:04:56,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2025-03-08 22:04:56,806 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 658 flow. Second operand 3 states and 964 transitions. [2025-03-08 22:04:56,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 683 flow [2025-03-08 22:04:56,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 297 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:56,809 INFO L231 Difference]: Finished difference. Result has 303 places, 296 transitions, 660 flow [2025-03-08 22:04:56,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=301, 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=660, PETRI_PLACES=303, PETRI_TRANSITIONS=296} [2025-03-08 22:04:56,810 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2025-03-08 22:04:56,810 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 660 flow [2025-03-08 22:04:56,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:56,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:04:56,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -845605546, now seen corresponding path program 1 times [2025-03-08 22:04:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813244118] [2025-03-08 22:04:56,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 22:04:56,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 22:04:56,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813244118] [2025-03-08 22:04:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813244118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:56,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283390374] [2025-03-08 22:04:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:56,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:56,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:56,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:56,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2025-03-08 22:04:56,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:56,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2025-03-08 22:04:56,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:56,914 INFO L124 PetriNetUnfolderBase]: 20/536 cut-off events. [2025-03-08 22:04:56,914 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-08 22:04:56,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 536 events. 20/536 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1656 event pairs, 2 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 543. Up to 24 conditions per place. [2025-03-08 22:04:56,916 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-03-08 22:04:56,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 685 flow [2025-03-08 22:04:56,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-08 22:04:56,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2025-03-08 22:04:56,918 INFO L175 Difference]: Start difference. First operand has 303 places, 296 transitions, 660 flow. Second operand 3 states and 964 transitions. [2025-03-08 22:04:56,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 685 flow [2025-03-08 22:04:56,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 296 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:56,923 INFO L231 Difference]: Finished difference. Result has 302 places, 295 transitions, 658 flow [2025-03-08 22:04:56,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=295} [2025-03-08 22:04:56,924 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2025-03-08 22:04:56,924 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 295 transitions, 658 flow [2025-03-08 22:04:56,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:56,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:56,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:56,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:56,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash -272778956, now seen corresponding path program 1 times [2025-03-08 22:04:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344523113] [2025-03-08 22:04:56,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:56,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:56,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 22:04:56,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 22:04:56,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:56,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344523113] [2025-03-08 22:04:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344523113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823455055] [2025-03-08 22:04:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2025-03-08 22:04:57,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2025-03-08 22:04:57,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,093 INFO L124 PetriNetUnfolderBase]: 20/639 cut-off events. [2025-03-08 22:04:57,093 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-08 22:04:57,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 639 events. 20/639 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2204 event pairs, 3 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 620. Up to 25 conditions per place. [2025-03-08 22:04:57,096 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 13 selfloop transitions, 1 changer transitions 2/298 dead transitions. [2025-03-08 22:04:57,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 695 flow [2025-03-08 22:04:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2025-03-08 22:04:57,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9472140762463344 [2025-03-08 22:04:57,100 INFO L175 Difference]: Start difference. First operand has 302 places, 295 transitions, 658 flow. Second operand 3 states and 969 transitions. [2025-03-08 22:04:57,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 695 flow [2025-03-08 22:04:57,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:57,105 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 655 flow [2025-03-08 22:04:57,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2025-03-08 22:04:57,107 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2025-03-08 22:04:57,107 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 655 flow [2025-03-08 22:04:57,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:57,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:04:57,108 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:57,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1213373924, now seen corresponding path program 2 times [2025-03-08 22:04:57,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392941650] [2025-03-08 22:04:57,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:57,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 224 statements into 1 equivalence classes. [2025-03-08 22:04:57,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 22:04:57,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392941650] [2025-03-08 22:04:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392941650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178215692] [2025-03-08 22:04:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2025-03-08 22:04:57,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2025-03-08 22:04:57,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,278 INFO L124 PetriNetUnfolderBase]: 18/719 cut-off events. [2025-03-08 22:04:57,278 INFO L125 PetriNetUnfolderBase]: For 33/37 co-relation queries the response was YES. [2025-03-08 22:04:57,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 719 events. 18/719 cut-off events. For 33/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2677 event pairs, 4 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 715. Up to 31 conditions per place. [2025-03-08 22:04:57,281 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 12 selfloop transitions, 1 changer transitions 2/295 dead transitions. [2025-03-08 22:04:57,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 687 flow [2025-03-08 22:04:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-08 22:04:57,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2025-03-08 22:04:57,283 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 655 flow. Second operand 3 states and 968 transitions. [2025-03-08 22:04:57,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 687 flow [2025-03-08 22:04:57,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 295 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:57,288 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 655 flow [2025-03-08 22:04:57,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2025-03-08 22:04:57,289 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2025-03-08 22:04:57,289 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 655 flow [2025-03-08 22:04:57,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:57,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:57,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:57,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1050298505, now seen corresponding path program 1 times [2025-03-08 22:04:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342456952] [2025-03-08 22:04:57,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 22:04:57,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 22:04:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:57,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342456952] [2025-03-08 22:04:57,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342456952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737887217] [2025-03-08 22:04:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2025-03-08 22:04:57,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2025-03-08 22:04:57,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,427 INFO L124 PetriNetUnfolderBase]: 16/675 cut-off events. [2025-03-08 22:04:57,428 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2025-03-08 22:04:57,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 675 events. 16/675 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2446 event pairs, 2 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 687. Up to 22 conditions per place. [2025-03-08 22:04:57,431 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2025-03-08 22:04:57,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 671 flow [2025-03-08 22:04:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2025-03-08 22:04:57,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374389051808406 [2025-03-08 22:04:57,433 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 655 flow. Second operand 3 states and 959 transitions. [2025-03-08 22:04:57,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 671 flow [2025-03-08 22:04:57,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 288 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:57,436 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 650 flow [2025-03-08 22:04:57,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2025-03-08 22:04:57,437 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2025-03-08 22:04:57,437 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 650 flow [2025-03-08 22:04:57,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:57,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:57,439 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-03-08 22:04:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1492978116, now seen corresponding path program 1 times [2025-03-08 22:04:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785084007] [2025-03-08 22:04:57,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:57,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 22:04:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 22:04:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:57,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:04:57,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:57,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785084007] [2025-03-08 22:04:57,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785084007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:57,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:57,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:57,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526694233] [2025-03-08 22:04:57,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:57,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:57,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:57,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:57,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:57,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2025-03-08 22:04:57,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:57,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2025-03-08 22:04:57,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:57,583 INFO L124 PetriNetUnfolderBase]: 18/740 cut-off events. [2025-03-08 22:04:57,583 INFO L125 PetriNetUnfolderBase]: For 18/21 co-relation queries the response was YES. [2025-03-08 22:04:57,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 740 events. 18/740 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2854 event pairs, 3 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 718. Up to 28 conditions per place. [2025-03-08 22:04:57,585 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2025-03-08 22:04:57,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 672 flow [2025-03-08 22:04:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-08 22:04:57,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2025-03-08 22:04:57,587 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 650 flow. Second operand 3 states and 960 transitions. [2025-03-08 22:04:57,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 672 flow [2025-03-08 22:04:57,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 287 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:57,590 INFO L231 Difference]: Finished difference. Result has 297 places, 0 transitions, 0 flow [2025-03-08 22:04:57,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=297, PETRI_TRANSITIONS=0} [2025-03-08 22:04:57,591 INFO L279 CegarLoopForPetriNet]: 312 programPoint places, -15 predicate places. [2025-03-08 22:04:57,591 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 0 transitions, 0 flow [2025-03-08 22:04:57,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:04:57,595 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-03-08 22:04:57,596 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-03-08 22:04:57,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-03-08 22:04:57,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:04:57,598 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:57,604 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:04:57,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:04:57,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:04:57 BasicIcfg [2025-03-08 22:04:57,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:04:57,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:04:57,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:04:57,611 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:04:57,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:54" (3/4) ... [2025-03-08 22:04:57,612 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:04:57,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:04:57,615 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:04:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 22:04:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:04:57,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:04:57,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:04:57,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:04:57,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:04:57,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:04:57,686 INFO L158 Benchmark]: Toolchain (without parser) took 3976.46ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.4MB in the beginning and 113.2MB in the end (delta: 10.2MB). Peak memory consumption was 173.5MB. Max. memory is 16.1GB. [2025-03-08 22:04:57,687 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:57,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.56ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 111.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:04:57,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:57,688 INFO L158 Benchmark]: Boogie Preprocessor took 21.72ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:04:57,688 INFO L158 Benchmark]: IcfgBuilder took 454.37ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 85.4MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:04:57,689 INFO L158 Benchmark]: TraceAbstraction took 3204.00ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 84.6MB in the beginning and 120.8MB in the end (delta: -36.2MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. [2025-03-08 22:04:57,689 INFO L158 Benchmark]: Witness Printer took 74.93ms. Allocated memory is still 335.5MB. Free memory was 120.8MB in the beginning and 113.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:04:57,691 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.56ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 111.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.72ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 108.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 454.37ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 85.4MB in the end (delta: 22.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3204.00ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 84.6MB in the beginning and 120.8MB in the end (delta: -36.2MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. * Witness Printer took 74.93ms. Allocated memory is still 335.5MB. Free memory was 120.8MB in the beginning and 113.2MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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, 508 locations, 533 edges, 50 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: 3.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 125 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2020 NumberOfCodeBlocks, 2020 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:04:57,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE