./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/bench-exp2x9.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 af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:10:57,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:10:57,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:10:57,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:10:57,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:10:57,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:10:57,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:10:57,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:10:57,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:10:57,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:10:57,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:10:57,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:10:57,162 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:10:57,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:10:57,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:10:57,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:10:57,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:10:57,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:10:57,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:10:57,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:10:57,164 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 -> af523f24b0126267447f5590b01302c6de6f439c37a01df1dbf66192a849a6d6 [2025-03-17 11:10:57,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:10:57,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:10:57,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:10:57,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:10:57,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:10:57,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-17 11:10:58,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8091da60c/9ec7a2f9640443b79c17b1b21e47a217/FLAGfd8d91c04 [2025-03-17 11:10:58,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:10:58,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x9.wvr.c [2025-03-17 11:10:58,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8091da60c/9ec7a2f9640443b79c17b1b21e47a217/FLAGfd8d91c04 [2025-03-17 11:10:59,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8091da60c/9ec7a2f9640443b79c17b1b21e47a217 [2025-03-17 11:10:59,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:10:59,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:10:59,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:10:59,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:10:59,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:10:59,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1185f82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59, skipping insertion in model container [2025-03-17 11:10:59,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:10:59,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:10:59,181 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:10:59,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:10:59,226 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:10:59,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59 WrapperNode [2025-03-17 11:10:59,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:10:59,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:10:59,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:10:59,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:10:59,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,254 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-03-17 11:10:59,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:10:59,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:10:59,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:10:59,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:10:59,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:10:59,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:10:59,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:10:59,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:10:59,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (1/1) ... [2025-03-17 11:10:59,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:10:59,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:10:59,334 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-17 11:10:59,338 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-17 11:10:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:10:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:10:59,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:10:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:10:59,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:10:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:10:59,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:10:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 11:10:59,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 11:10:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:10:59,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:10:59,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:10:59,359 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:10:59,437 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:10:59,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:10:59,942 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:10:59,942 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:10:59,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:10:59,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:10:59,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:59 BoogieIcfgContainer [2025-03-17 11:10:59,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:10:59,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:10:59,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:10:59,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:10:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:10:59" (1/3) ... [2025-03-17 11:10:59,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499a1940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:10:59, skipping insertion in model container [2025-03-17 11:10:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:10:59" (2/3) ... [2025-03-17 11:10:59,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499a1940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:10:59, skipping insertion in model container [2025-03-17 11:10:59,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:59" (3/3) ... [2025-03-17 11:10:59,966 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2025-03-17 11:10:59,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:10:59,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x9.wvr.c that has 5 procedures, 534 locations, 1 initial locations, 4 loop locations, and 107 error locations. [2025-03-17 11:10:59,977 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:00,087 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 11:11:00,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 547 transitions, 1122 flow [2025-03-17 11:11:00,326 INFO L124 PetriNetUnfolderBase]: 14/543 cut-off events. [2025-03-17 11:11:00,328 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:11:00,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 543 events. 14/543 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1826 event pairs, 0 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2025-03-17 11:11:00,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 546 places, 547 transitions, 1122 flow [2025-03-17 11:11:00,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 524 places, 523 transitions, 1070 flow [2025-03-17 11:11:00,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:00,370 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;@5b66e813, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:00,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 203 error locations. [2025-03-17 11:11:00,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:00,374 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-17 11:11:00,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:00,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:00,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:00,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 515612113, now seen corresponding path program 1 times [2025-03-17 11:11:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:00,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579062280] [2025-03-17 11:11:00,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:00,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:00,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 11:11:00,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 11:11:00,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:00,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:00,521 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-17 11:11:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579062280] [2025-03-17 11:11:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579062280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:00,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806315145] [2025-03-17 11:11:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:00,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:00,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:00,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:00,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-03-17 11:11:00,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 523 transitions, 1070 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-17 11:11:00,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:00,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-03-17 11:11:00,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:00,935 INFO L124 PetriNetUnfolderBase]: 76/868 cut-off events. [2025-03-17 11:11:00,935 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-17 11:11:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 868 events. 76/868 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4783 event pairs, 66 based on Foata normal form. 145/825 useless extension candidates. Maximal degree in co-relation 1049. Up to 172 conditions per place. [2025-03-17 11:11:00,961 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 36 selfloop transitions, 2 changer transitions 1/517 dead transitions. [2025-03-17 11:11:00,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 517 transitions, 1134 flow [2025-03-17 11:11:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1544 transitions. [2025-03-17 11:11:00,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408897014015845 [2025-03-17 11:11:00,979 INFO L175 Difference]: Start difference. First operand has 524 places, 523 transitions, 1070 flow. Second operand 3 states and 1544 transitions. [2025-03-17 11:11:00,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 517 transitions, 1134 flow [2025-03-17 11:11:00,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 517 transitions, 1118 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 11:11:00,997 INFO L231 Difference]: Finished difference. Result has 517 places, 516 transitions, 1044 flow [2025-03-17 11:11:00,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1044, PETRI_PLACES=517, PETRI_TRANSITIONS=516} [2025-03-17 11:11:01,003 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -7 predicate places. [2025-03-17 11:11:01,004 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 516 transitions, 1044 flow [2025-03-17 11:11:01,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-17 11:11:01,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:01,005 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] [2025-03-17 11:11:01,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:01,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:01,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1113129615, now seen corresponding path program 1 times [2025-03-17 11:11:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945464089] [2025-03-17 11:11:01,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:01,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:11:01,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:11:01,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:01,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:01,058 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-17 11:11:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:01,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945464089] [2025-03-17 11:11:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945464089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:01,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457485108] [2025-03-17 11:11:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:01,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:01,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:01,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-03-17 11:11:01,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 516 transitions, 1044 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-17 11:11:01,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:01,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-03-17 11:11:01,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:01,420 INFO L124 PetriNetUnfolderBase]: 76/866 cut-off events. [2025-03-17 11:11:01,420 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 11:11:01,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 866 events. 76/866 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4952 event pairs, 66 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1061. Up to 171 conditions per place. [2025-03-17 11:11:01,444 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/515 dead transitions. [2025-03-17 11:11:01,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 515 transitions, 1116 flow [2025-03-17 11:11:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-03-17 11:11:01,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-03-17 11:11:01,447 INFO L175 Difference]: Start difference. First operand has 517 places, 516 transitions, 1044 flow. Second operand 3 states and 1541 transitions. [2025-03-17 11:11:01,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 515 transitions, 1116 flow [2025-03-17 11:11:01,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 515 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:01,454 INFO L231 Difference]: Finished difference. Result has 515 places, 515 transitions, 1042 flow [2025-03-17 11:11:01,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=515, PETRI_TRANSITIONS=515} [2025-03-17 11:11:01,455 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -9 predicate places. [2025-03-17 11:11:01,455 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 515 transitions, 1042 flow [2025-03-17 11:11:01,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-17 11:11:01,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:01,456 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] [2025-03-17 11:11:01,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:01,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:01,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1891003727, now seen corresponding path program 1 times [2025-03-17 11:11:01,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:01,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556090755] [2025-03-17 11:11:01,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:01,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:01,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 11:11:01,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 11:11:01,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:01,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:01,501 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-17 11:11:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556090755] [2025-03-17 11:11:01,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556090755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:01,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:01,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229561752] [2025-03-17 11:11:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:01,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:01,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:01,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:01,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 500 out of 547 [2025-03-17 11:11:01,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 515 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-17 11:11:01,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:01,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 500 of 547 [2025-03-17 11:11:01,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:01,827 INFO L124 PetriNetUnfolderBase]: 76/793 cut-off events. [2025-03-17 11:11:01,828 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-17 11:11:01,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 793 events. 76/793 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4313 event pairs, 66 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 960. Up to 172 conditions per place. [2025-03-17 11:11:01,856 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/514 dead transitions. [2025-03-17 11:11:01,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 514 transitions, 1116 flow [2025-03-17 11:11:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1539 transitions. [2025-03-17 11:11:01,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378427787934186 [2025-03-17 11:11:01,860 INFO L175 Difference]: Start difference. First operand has 515 places, 515 transitions, 1042 flow. Second operand 3 states and 1539 transitions. [2025-03-17 11:11:01,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 514 transitions, 1116 flow [2025-03-17 11:11:01,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 514 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:01,869 INFO L231 Difference]: Finished difference. Result has 514 places, 514 transitions, 1040 flow [2025-03-17 11:11:01,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=514, PETRI_TRANSITIONS=514} [2025-03-17 11:11:01,870 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -10 predicate places. [2025-03-17 11:11:01,871 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 514 transitions, 1040 flow [2025-03-17 11:11:01,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 501.3333333333333) internal successors, (1504), 3 states have internal predecessors, (1504), 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-17 11:11:01,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:01,872 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] [2025-03-17 11:11:01,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:01,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:01,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:01,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1409282403, now seen corresponding path program 1 times [2025-03-17 11:11:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353233111] [2025-03-17 11:11:01,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:11:01,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:11:01,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:01,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:01,903 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-17 11:11:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353233111] [2025-03-17 11:11:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353233111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568635420] [2025-03-17 11:11:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:01,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:01,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:01,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:02,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 501 out of 547 [2025-03-17 11:11:02,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 514 transitions, 1040 flow. Second operand has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-17 11:11:02,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:02,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 501 of 547 [2025-03-17 11:11:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:02,147 INFO L124 PetriNetUnfolderBase]: 76/720 cut-off events. [2025-03-17 11:11:02,147 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-17 11:11:02,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 720 events. 76/720 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3607 event pairs, 66 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 857. Up to 171 conditions per place. [2025-03-17 11:11:02,165 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 35 selfloop transitions, 2 changer transitions 0/513 dead transitions. [2025-03-17 11:11:02,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 513 transitions, 1112 flow [2025-03-17 11:11:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2025-03-17 11:11:02,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9390615478366849 [2025-03-17 11:11:02,168 INFO L175 Difference]: Start difference. First operand has 514 places, 514 transitions, 1040 flow. Second operand 3 states and 1541 transitions. [2025-03-17 11:11:02,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 513 transitions, 1112 flow [2025-03-17 11:11:02,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 513 transitions, 1108 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:02,176 INFO L231 Difference]: Finished difference. Result has 513 places, 513 transitions, 1038 flow [2025-03-17 11:11:02,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1038, PETRI_PLACES=513, PETRI_TRANSITIONS=513} [2025-03-17 11:11:02,177 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -11 predicate places. [2025-03-17 11:11:02,178 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 513 transitions, 1038 flow [2025-03-17 11:11:02,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 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-17 11:11:02,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:02,179 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] [2025-03-17 11:11:02,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:02,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:02,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1307136923, now seen corresponding path program 1 times [2025-03-17 11:11:02,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:02,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713731623] [2025-03-17 11:11:02,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:02,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:11:02,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:11:02,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:02,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:02,208 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-17 11:11:02,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713731623] [2025-03-17 11:11:02,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713731623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:02,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:02,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:02,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211841625] [2025-03-17 11:11:02,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:02,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:02,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:02,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:02,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:02,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 521 out of 547 [2025-03-17 11:11:02,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 513 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 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-17 11:11:02,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:02,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 521 of 547 [2025-03-17 11:11:02,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:02,699 INFO L124 PetriNetUnfolderBase]: 102/3430 cut-off events. [2025-03-17 11:11:02,699 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-17 11:11:02,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3595 conditions, 3430 events. 102/3430 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 31168 event pairs, 51 based on Foata normal form. 0/2582 useless extension candidates. Maximal degree in co-relation 3544. Up to 144 conditions per place. [2025-03-17 11:11:02,765 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 15 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-03-17 11:11:02,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 512 transitions, 1070 flow [2025-03-17 11:11:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1581 transitions. [2025-03-17 11:11:02,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634369287020109 [2025-03-17 11:11:02,768 INFO L175 Difference]: Start difference. First operand has 513 places, 513 transitions, 1038 flow. Second operand 3 states and 1581 transitions. [2025-03-17 11:11:02,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 512 transitions, 1070 flow [2025-03-17 11:11:02,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:02,775 INFO L231 Difference]: Finished difference. Result has 512 places, 512 transitions, 1036 flow [2025-03-17 11:11:02,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=512, PETRI_TRANSITIONS=512} [2025-03-17 11:11:02,776 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -12 predicate places. [2025-03-17 11:11:02,776 INFO L471 AbstractCegarLoop]: Abstraction has has 512 places, 512 transitions, 1036 flow [2025-03-17 11:11:02,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 522.3333333333334) internal successors, (1567), 3 states have internal predecessors, (1567), 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-17 11:11:02,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:02,777 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] [2025-03-17 11:11:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:02,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:02,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -853855177, now seen corresponding path program 1 times [2025-03-17 11:11:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:02,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789781283] [2025-03-17 11:11:02,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:11:02,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:11:02,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:02,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:02,808 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-17 11:11:02,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:02,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789781283] [2025-03-17 11:11:02,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789781283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:02,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:02,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529514772] [2025-03-17 11:11:02,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:02,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:02,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:02,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:02,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:02,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-03-17 11:11:02,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 512 transitions, 1036 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-17 11:11:02,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:02,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-03-17 11:11:02,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:03,035 INFO L124 PetriNetUnfolderBase]: 121/846 cut-off events. [2025-03-17 11:11:03,036 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:11:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 846 events. 121/846 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4959 event pairs, 90 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 1186. Up to 228 conditions per place. [2025-03-17 11:11:03,057 INFO L140 encePairwiseOnDemand]: 514/547 looper letters, 41 selfloop transitions, 15 changer transitions 0/498 dead transitions. [2025-03-17 11:11:03,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 498 transitions, 1123 flow [2025-03-17 11:11:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1484 transitions. [2025-03-17 11:11:03,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9043266301035954 [2025-03-17 11:11:03,060 INFO L175 Difference]: Start difference. First operand has 512 places, 512 transitions, 1036 flow. Second operand 3 states and 1484 transitions. [2025-03-17 11:11:03,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 498 transitions, 1123 flow [2025-03-17 11:11:03,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 498 transitions, 1119 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:03,069 INFO L231 Difference]: Finished difference. Result has 495 places, 495 transitions, 1045 flow [2025-03-17 11:11:03,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=495, PETRI_TRANSITIONS=495} [2025-03-17 11:11:03,070 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -29 predicate places. [2025-03-17 11:11:03,071 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 495 transitions, 1045 flow [2025-03-17 11:11:03,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-17 11:11:03,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:03,072 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-17 11:11:03,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:03,072 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:03,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash -216042300, now seen corresponding path program 1 times [2025-03-17 11:11:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:03,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767271364] [2025-03-17 11:11:03,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:03,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:11:03,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:11:03,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:03,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:03,116 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-17 11:11:03,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:03,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767271364] [2025-03-17 11:11:03,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767271364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:03,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:03,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548289552] [2025-03-17 11:11:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:03,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:03,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:03,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:03,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:03,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-03-17 11:11:03,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 495 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-17 11:11:03,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:03,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-03-17 11:11:03,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:03,374 INFO L124 PetriNetUnfolderBase]: 121/830 cut-off events. [2025-03-17 11:11:03,374 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 11:11:03,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 830 events. 121/830 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4947 event pairs, 90 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1066. Up to 226 conditions per place. [2025-03-17 11:11:03,390 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 39 selfloop transitions, 15 changer transitions 0/482 dead transitions. [2025-03-17 11:11:03,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 482 transitions, 1130 flow [2025-03-17 11:11:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1490 transitions. [2025-03-17 11:11:03,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079829372333943 [2025-03-17 11:11:03,394 INFO L175 Difference]: Start difference. First operand has 495 places, 495 transitions, 1045 flow. Second operand 3 states and 1490 transitions. [2025-03-17 11:11:03,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 482 transitions, 1130 flow [2025-03-17 11:11:03,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 482 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:03,400 INFO L231 Difference]: Finished difference. Result has 480 places, 479 transitions, 1045 flow [2025-03-17 11:11:03,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=480, PETRI_TRANSITIONS=479} [2025-03-17 11:11:03,401 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -44 predicate places. [2025-03-17 11:11:03,401 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 479 transitions, 1045 flow [2025-03-17 11:11:03,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-17 11:11:03,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:03,402 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] [2025-03-17 11:11:03,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:03,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:03,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1653285935, now seen corresponding path program 1 times [2025-03-17 11:11:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:03,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875693206] [2025-03-17 11:11:03,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:03,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:03,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:11:03,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:11:03,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:03,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:03,439 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-17 11:11:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875693206] [2025-03-17 11:11:03,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875693206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:03,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:03,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:03,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4301479] [2025-03-17 11:11:03,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:03,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:03,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:03,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:03,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 547 [2025-03-17 11:11:03,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 479 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-17 11:11:03,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:03,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 547 [2025-03-17 11:11:03,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:03,733 INFO L124 PetriNetUnfolderBase]: 128/1092 cut-off events. [2025-03-17 11:11:03,733 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-17 11:11:03,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 1092 events. 128/1092 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6951 event pairs, 21 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1271. Up to 232 conditions per place. [2025-03-17 11:11:03,761 INFO L140 encePairwiseOnDemand]: 513/547 looper letters, 44 selfloop transitions, 16 changer transitions 0/469 dead transitions. [2025-03-17 11:11:03,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 469 transitions, 1151 flow [2025-03-17 11:11:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1488 transitions. [2025-03-17 11:11:03,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.906764168190128 [2025-03-17 11:11:03,764 INFO L175 Difference]: Start difference. First operand has 480 places, 479 transitions, 1045 flow. Second operand 3 states and 1488 transitions. [2025-03-17 11:11:03,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 469 transitions, 1151 flow [2025-03-17 11:11:03,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 469 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:03,770 INFO L231 Difference]: Finished difference. Result has 464 places, 463 transitions, 1050 flow [2025-03-17 11:11:03,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=464, PETRI_TRANSITIONS=463} [2025-03-17 11:11:03,772 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -60 predicate places. [2025-03-17 11:11:03,772 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 463 transitions, 1050 flow [2025-03-17 11:11:03,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.0) internal successors, (1413), 3 states have internal predecessors, (1413), 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-17 11:11:03,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:03,773 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-17 11:11:03,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:03,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:03,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash -330083932, now seen corresponding path program 1 times [2025-03-17 11:11:03,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:03,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485612887] [2025-03-17 11:11:03,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:03,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:03,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:11:03,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:11:03,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:03,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:03,817 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-17 11:11:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485612887] [2025-03-17 11:11:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485612887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:03,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:03,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:11:03,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724623744] [2025-03-17 11:11:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:03,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:11:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:03,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:11:03,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:11:03,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 520 out of 547 [2025-03-17 11:11:03,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 463 transitions, 1050 flow. Second operand has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 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-17 11:11:03,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:03,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 520 of 547 [2025-03-17 11:11:03,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:03,994 INFO L124 PetriNetUnfolderBase]: 12/791 cut-off events. [2025-03-17 11:11:03,994 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-17 11:11:04,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 791 events. 12/791 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3615 event pairs, 0 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 657. Up to 26 conditions per place. [2025-03-17 11:11:04,008 INFO L140 encePairwiseOnDemand]: 541/547 looper letters, 19 selfloop transitions, 5 changer transitions 0/468 dead transitions. [2025-03-17 11:11:04,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 468 transitions, 1108 flow [2025-03-17 11:11:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:11:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 11:11:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2625 transitions. [2025-03-17 11:11:04,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9597806215722121 [2025-03-17 11:11:04,013 INFO L175 Difference]: Start difference. First operand has 464 places, 463 transitions, 1050 flow. Second operand 5 states and 2625 transitions. [2025-03-17 11:11:04,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 468 transitions, 1108 flow [2025-03-17 11:11:04,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 468 transitions, 1092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:04,021 INFO L231 Difference]: Finished difference. Result has 471 places, 467 transitions, 1072 flow [2025-03-17 11:11:04,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1072, PETRI_PLACES=471, PETRI_TRANSITIONS=467} [2025-03-17 11:11:04,022 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -53 predicate places. [2025-03-17 11:11:04,022 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 467 transitions, 1072 flow [2025-03-17 11:11:04,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 521.25) internal successors, (2085), 4 states have internal predecessors, (2085), 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-17 11:11:04,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:04,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:04,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:04,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:04,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -288354942, now seen corresponding path program 1 times [2025-03-17 11:11:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544271925] [2025-03-17 11:11:04,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:04,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 11:11:04,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 11:11:04,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:04,053 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-17 11:11:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544271925] [2025-03-17 11:11:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544271925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915606600] [2025-03-17 11:11:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:04,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:04,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 473 out of 547 [2025-03-17 11:11:04,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 467 transitions, 1072 flow. Second operand has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-17 11:11:04,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:04,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 473 of 547 [2025-03-17 11:11:04,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:04,490 INFO L124 PetriNetUnfolderBase]: 208/1557 cut-off events. [2025-03-17 11:11:04,490 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-17 11:11:04,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1557 events. 208/1557 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11623 event pairs, 35 based on Foata normal form. 1/1441 useless extension candidates. Maximal degree in co-relation 1733. Up to 380 conditions per place. [2025-03-17 11:11:04,524 INFO L140 encePairwiseOnDemand]: 515/547 looper letters, 40 selfloop transitions, 15 changer transitions 10/458 dead transitions. [2025-03-17 11:11:04,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 458 transitions, 1175 flow [2025-03-17 11:11:04,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1493 transitions. [2025-03-17 11:11:04,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098110907982937 [2025-03-17 11:11:04,528 INFO L175 Difference]: Start difference. First operand has 471 places, 467 transitions, 1072 flow. Second operand 3 states and 1493 transitions. [2025-03-17 11:11:04,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 458 transitions, 1175 flow [2025-03-17 11:11:04,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 458 transitions, 1175 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:04,537 INFO L231 Difference]: Finished difference. Result has 457 places, 441 transitions, 1066 flow [2025-03-17 11:11:04,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=457, PETRI_TRANSITIONS=441} [2025-03-17 11:11:04,538 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -67 predicate places. [2025-03-17 11:11:04,538 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 441 transitions, 1066 flow [2025-03-17 11:11:04,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 474.0) internal successors, (1422), 3 states have internal predecessors, (1422), 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-17 11:11:04,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:04,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, 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-17 11:11:04,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:11:04,539 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:04,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 609605096, now seen corresponding path program 1 times [2025-03-17 11:11:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:04,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767741789] [2025-03-17 11:11:04,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:04,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:11:04,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:11:04,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:04,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:04,604 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-17 11:11:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767741789] [2025-03-17 11:11:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767741789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:04,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278414587] [2025-03-17 11:11:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:04,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:04,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 519 out of 547 [2025-03-17 11:11:04,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 441 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 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-17 11:11:04,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:04,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 519 of 547 [2025-03-17 11:11:04,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:06,404 INFO L124 PetriNetUnfolderBase]: 751/14488 cut-off events. [2025-03-17 11:11:06,404 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2025-03-17 11:11:06,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18474 conditions, 14488 events. 751/14488 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 189619 event pairs, 349 based on Foata normal form. 0/12928 useless extension candidates. Maximal degree in co-relation 14026. Up to 1015 conditions per place. [2025-03-17 11:11:06,525 INFO L140 encePairwiseOnDemand]: 539/547 looper letters, 19 selfloop transitions, 4 changer transitions 0/444 dead transitions. [2025-03-17 11:11:06,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 444 transitions, 1121 flow [2025-03-17 11:11:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1584 transitions. [2025-03-17 11:11:06,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9652650822669104 [2025-03-17 11:11:06,528 INFO L175 Difference]: Start difference. First operand has 457 places, 441 transitions, 1066 flow. Second operand 3 states and 1584 transitions. [2025-03-17 11:11:06,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 444 transitions, 1121 flow [2025-03-17 11:11:06,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 1106 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:11:06,541 INFO L231 Difference]: Finished difference. Result has 445 places, 441 transitions, 1071 flow [2025-03-17 11:11:06,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=441} [2025-03-17 11:11:06,542 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-03-17 11:11:06,542 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 441 transitions, 1071 flow [2025-03-17 11:11:06,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 520.3333333333334) internal successors, (1561), 3 states have internal predecessors, (1561), 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-17 11:11:06,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:06,543 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] [2025-03-17 11:11:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:11:06,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:06,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:06,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1934383078, now seen corresponding path program 1 times [2025-03-17 11:11:06,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:06,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706727139] [2025-03-17 11:11:06,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:06,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:11:06,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:11:06,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:06,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:06,584 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-17 11:11:06,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:06,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706727139] [2025-03-17 11:11:06,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706727139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:06,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147456737] [2025-03-17 11:11:06,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:06,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:06,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:06,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:06,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 441 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 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-17 11:11:06,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:06,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:06,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:07,402 INFO L124 PetriNetUnfolderBase]: 365/4355 cut-off events. [2025-03-17 11:11:07,403 INFO L125 PetriNetUnfolderBase]: For 167/179 co-relation queries the response was YES. [2025-03-17 11:11:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6095 conditions, 4355 events. 365/4355 cut-off events. For 167/179 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 42901 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 4185. Up to 528 conditions per place. [2025-03-17 11:11:07,477 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-17 11:11:07,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 443 transitions, 1156 flow [2025-03-17 11:11:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:07,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:07,481 INFO L175 Difference]: Start difference. First operand has 445 places, 441 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:07,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 443 transitions, 1156 flow [2025-03-17 11:11:07,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 443 transitions, 1156 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:11:07,489 INFO L231 Difference]: Finished difference. Result has 446 places, 440 transitions, 1073 flow [2025-03-17 11:11:07,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=446, PETRI_TRANSITIONS=440} [2025-03-17 11:11:07,490 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -78 predicate places. [2025-03-17 11:11:07,490 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 440 transitions, 1073 flow [2025-03-17 11:11:07,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.0) internal successors, (1515), 3 states have internal predecessors, (1515), 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-17 11:11:07,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:07,491 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] [2025-03-17 11:11:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:11:07,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:07,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 487086744, now seen corresponding path program 1 times [2025-03-17 11:11:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18235653] [2025-03-17 11:11:07,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:07,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:07,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:11:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:11:07,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:07,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:07,534 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-17 11:11:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18235653] [2025-03-17 11:11:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18235653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866495737] [2025-03-17 11:11:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:07,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:07,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:07,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:07,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:07,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:07,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 440 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-17 11:11:07,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:07,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:07,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:08,890 INFO L124 PetriNetUnfolderBase]: 742/5750 cut-off events. [2025-03-17 11:11:08,890 INFO L125 PetriNetUnfolderBase]: For 670/678 co-relation queries the response was YES. [2025-03-17 11:11:08,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8890 conditions, 5750 events. 742/5750 cut-off events. For 670/678 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 60955 event pairs, 545 based on Foata normal form. 0/5227 useless extension candidates. Maximal degree in co-relation 8581. Up to 1441 conditions per place. [2025-03-17 11:11:08,974 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/442 dead transitions. [2025-03-17 11:11:08,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 442 transitions, 1156 flow [2025-03-17 11:11:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:08,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:08,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:08,976 INFO L175 Difference]: Start difference. First operand has 446 places, 440 transitions, 1073 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:08,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 442 transitions, 1156 flow [2025-03-17 11:11:08,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 442 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:08,984 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 1071 flow [2025-03-17 11:11:08,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1071, PETRI_PLACES=445, PETRI_TRANSITIONS=439} [2025-03-17 11:11:08,985 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -79 predicate places. [2025-03-17 11:11:08,985 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 1071 flow [2025-03-17 11:11:08,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-17 11:11:08,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:08,986 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] [2025-03-17 11:11:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:11:08,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash -235889483, now seen corresponding path program 1 times [2025-03-17 11:11:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856863536] [2025-03-17 11:11:08,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:08,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:11:08,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:11:09,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:09,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:09,035 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-17 11:11:09,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:09,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856863536] [2025-03-17 11:11:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856863536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528057667] [2025-03-17 11:11:09,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:09,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:09,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:09,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:09,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 439 transitions, 1071 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 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-17 11:11:09,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:09,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:09,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:09,671 INFO L124 PetriNetUnfolderBase]: 365/4331 cut-off events. [2025-03-17 11:11:09,671 INFO L125 PetriNetUnfolderBase]: For 179/188 co-relation queries the response was YES. [2025-03-17 11:11:09,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6096 conditions, 4331 events. 365/4331 cut-off events. For 179/188 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 42632 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5064. Up to 528 conditions per place. [2025-03-17 11:11:09,765 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/441 dead transitions. [2025-03-17 11:11:09,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 441 transitions, 1156 flow [2025-03-17 11:11:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:09,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:09,768 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 1071 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:09,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 441 transitions, 1156 flow [2025-03-17 11:11:09,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 441 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:09,775 INFO L231 Difference]: Finished difference. Result has 444 places, 438 transitions, 1069 flow [2025-03-17 11:11:09,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1069, PETRI_PLACES=444, PETRI_TRANSITIONS=438} [2025-03-17 11:11:09,776 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -80 predicate places. [2025-03-17 11:11:09,777 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 438 transitions, 1069 flow [2025-03-17 11:11:09,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 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-17 11:11:09,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:09,778 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] [2025-03-17 11:11:09,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:11:09,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:09,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1959809290, now seen corresponding path program 1 times [2025-03-17 11:11:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:09,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200635383] [2025-03-17 11:11:09,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:09,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 11:11:09,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 11:11:09,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:09,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:09,811 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-17 11:11:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:09,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200635383] [2025-03-17 11:11:09,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200635383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:09,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:09,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:09,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822402910] [2025-03-17 11:11:09,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:09,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:09,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:09,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:09,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:09,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 438 transitions, 1069 flow. Second operand has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 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-17 11:11:09,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:09,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:09,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:10,557 INFO L124 PetriNetUnfolderBase]: 412/4330 cut-off events. [2025-03-17 11:11:10,558 INFO L125 PetriNetUnfolderBase]: For 414/417 co-relation queries the response was YES. [2025-03-17 11:11:10,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6108 conditions, 4330 events. 412/4330 cut-off events. For 414/417 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 42659 event pairs, 268 based on Foata normal form. 0/3928 useless extension candidates. Maximal degree in co-relation 5849. Up to 692 conditions per place. [2025-03-17 11:11:10,652 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/440 dead transitions. [2025-03-17 11:11:10,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1156 flow [2025-03-17 11:11:10,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:10,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:10,655 INFO L175 Difference]: Start difference. First operand has 444 places, 438 transitions, 1069 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:10,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1156 flow [2025-03-17 11:11:10,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 440 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:10,662 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 1067 flow [2025-03-17 11:11:10,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-03-17 11:11:10,663 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -81 predicate places. [2025-03-17 11:11:10,663 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 1067 flow [2025-03-17 11:11:10,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 505.3333333333333) internal successors, (1516), 3 states have internal predecessors, (1516), 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-17 11:11:10,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:10,664 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] [2025-03-17 11:11:10,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:11:10,664 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:10,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -144747869, now seen corresponding path program 1 times [2025-03-17 11:11:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294705906] [2025-03-17 11:11:10,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:10,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 11:11:10,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 11:11:10,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:10,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:10,696 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-17 11:11:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294705906] [2025-03-17 11:11:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294705906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:10,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306949614] [2025-03-17 11:11:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:10,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:10,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:10,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:10,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-17 11:11:10,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:10,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:11,689 INFO L124 PetriNetUnfolderBase]: 754/5924 cut-off events. [2025-03-17 11:11:11,689 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-17 11:11:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9132 conditions, 5924 events. 754/5924 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 62772 event pairs, 545 based on Foata normal form. 0/5424 useless extension candidates. Maximal degree in co-relation 8260. Up to 1441 conditions per place. [2025-03-17 11:11:11,813 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2025-03-17 11:11:11,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 439 transitions, 1150 flow [2025-03-17 11:11:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:11,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:11,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:11,816 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 1067 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:11,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 439 transitions, 1150 flow [2025-03-17 11:11:11,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 439 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:11,823 INFO L231 Difference]: Finished difference. Result has 442 places, 436 transitions, 1065 flow [2025-03-17 11:11:11,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1065, PETRI_PLACES=442, PETRI_TRANSITIONS=436} [2025-03-17 11:11:11,824 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -82 predicate places. [2025-03-17 11:11:11,824 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 436 transitions, 1065 flow [2025-03-17 11:11:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-17 11:11:11,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:11,825 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] [2025-03-17 11:11:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:11:11,825 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash -159847416, now seen corresponding path program 1 times [2025-03-17 11:11:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028293795] [2025-03-17 11:11:11,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:11:11,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:11:11,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:11,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:11,850 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-17 11:11:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028293795] [2025-03-17 11:11:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028293795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:11,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077600742] [2025-03-17 11:11:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:11,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:11,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:11,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:11,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:11,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 436 transitions, 1065 flow. Second operand has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 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-17 11:11:11,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:11,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:11,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:12,321 INFO L124 PetriNetUnfolderBase]: 235/3321 cut-off events. [2025-03-17 11:11:12,321 INFO L125 PetriNetUnfolderBase]: For 290/297 co-relation queries the response was YES. [2025-03-17 11:11:12,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4517 conditions, 3321 events. 235/3321 cut-off events. For 290/297 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 30117 event pairs, 129 based on Foata normal form. 1/3031 useless extension candidates. Maximal degree in co-relation 3627. Up to 389 conditions per place. [2025-03-17 11:11:12,384 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2025-03-17 11:11:12,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 438 transitions, 1148 flow [2025-03-17 11:11:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:12,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:12,386 INFO L175 Difference]: Start difference. First operand has 442 places, 436 transitions, 1065 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 438 transitions, 1148 flow [2025-03-17 11:11:12,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 438 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:12,393 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 1063 flow [2025-03-17 11:11:12,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1063, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2025-03-17 11:11:12,393 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -83 predicate places. [2025-03-17 11:11:12,393 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 1063 flow [2025-03-17 11:11:12,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 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-17 11:11:12,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:12,394 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] [2025-03-17 11:11:12,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:11:12,394 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:12,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:12,395 INFO L85 PathProgramCache]: Analyzing trace with hash 384977618, now seen corresponding path program 1 times [2025-03-17 11:11:12,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349350247] [2025-03-17 11:11:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:12,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:12,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 11:11:12,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 11:11:12,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:12,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:12,417 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-17 11:11:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349350247] [2025-03-17 11:11:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349350247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:12,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254578581] [2025-03-17 11:11:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:12,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:12,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 1063 flow. Second operand has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 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-17 11:11:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:13,297 INFO L124 PetriNetUnfolderBase]: 365/4283 cut-off events. [2025-03-17 11:11:13,298 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-17 11:11:13,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6046 conditions, 4283 events. 365/4283 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 41910 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5119. Up to 528 conditions per place. [2025-03-17 11:11:13,392 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2025-03-17 11:11:13,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 437 transitions, 1148 flow [2025-03-17 11:11:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:13,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:13,394 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 1063 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:13,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 437 transitions, 1148 flow [2025-03-17 11:11:13,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 437 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:13,402 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1061 flow [2025-03-17 11:11:13,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-03-17 11:11:13,402 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -84 predicate places. [2025-03-17 11:11:13,403 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1061 flow [2025-03-17 11:11:13,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.0) internal successors, (1521), 3 states have internal predecessors, (1521), 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-17 11:11:13,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:13,403 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] [2025-03-17 11:11:13,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:11:13,403 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1592121445, now seen corresponding path program 1 times [2025-03-17 11:11:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:13,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215071788] [2025-03-17 11:11:13,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:13,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:11:13,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:11:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:13,444 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-17 11:11:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215071788] [2025-03-17 11:11:13,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215071788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:13,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:13,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989296714] [2025-03-17 11:11:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:13,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:13,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:13,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:13,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:13,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-17 11:11:13,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:13,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:13,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:14,406 INFO L124 PetriNetUnfolderBase]: 412/4270 cut-off events. [2025-03-17 11:11:14,406 INFO L125 PetriNetUnfolderBase]: For 411/414 co-relation queries the response was YES. [2025-03-17 11:11:14,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6048 conditions, 4270 events. 412/4270 cut-off events. For 411/414 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 41910 event pairs, 268 based on Foata normal form. 0/3916 useless extension candidates. Maximal degree in co-relation 5825. Up to 692 conditions per place. [2025-03-17 11:11:14,502 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-17 11:11:14,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 1148 flow [2025-03-17 11:11:14,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:14,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:14,505 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1061 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:14,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 1148 flow [2025-03-17 11:11:14,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 436 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:14,512 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 1059 flow [2025-03-17 11:11:14,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2025-03-17 11:11:14,512 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -85 predicate places. [2025-03-17 11:11:14,512 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 1059 flow [2025-03-17 11:11:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 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-17 11:11:14,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:14,513 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] [2025-03-17 11:11:14,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:11:14,513 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:14,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1681797380, now seen corresponding path program 1 times [2025-03-17 11:11:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954933424] [2025-03-17 11:11:14,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:14,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:11:14,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:11:14,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:14,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:14,547 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-17 11:11:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:14,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954933424] [2025-03-17 11:11:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954933424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:14,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:14,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:14,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562968379] [2025-03-17 11:11:14,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:14,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:14,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:14,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:14,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:14,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:14,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 1059 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-17 11:11:14,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:14,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:14,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:15,619 INFO L124 PetriNetUnfolderBase]: 766/6081 cut-off events. [2025-03-17 11:11:15,619 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-17 11:11:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 6081 events. 766/6081 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 64275 event pairs, 545 based on Foata normal form. 0/5619 useless extension candidates. Maximal degree in co-relation 8585. Up to 1441 conditions per place. [2025-03-17 11:11:15,752 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2025-03-17 11:11:15,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 435 transitions, 1142 flow [2025-03-17 11:11:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:15,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:15,754 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 1059 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:15,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 435 transitions, 1142 flow [2025-03-17 11:11:15,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 435 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:15,760 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 1057 flow [2025-03-17 11:11:15,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2025-03-17 11:11:15,761 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -86 predicate places. [2025-03-17 11:11:15,761 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 1057 flow [2025-03-17 11:11:15,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-17 11:11:15,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:15,762 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] [2025-03-17 11:11:15,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:11:15,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1351811059, now seen corresponding path program 1 times [2025-03-17 11:11:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633994727] [2025-03-17 11:11:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:15,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:11:15,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:11:15,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:15,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:15,785 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-17 11:11:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633994727] [2025-03-17 11:11:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633994727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826391480] [2025-03-17 11:11:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:15,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:15,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:15,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:15,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 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-17 11:11:15,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:15,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:16,338 INFO L124 PetriNetUnfolderBase]: 235/3319 cut-off events. [2025-03-17 11:11:16,339 INFO L125 PetriNetUnfolderBase]: For 290/294 co-relation queries the response was YES. [2025-03-17 11:11:16,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 3319 events. 235/3319 cut-off events. For 290/294 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 30044 event pairs, 129 based on Foata normal form. 0/3060 useless extension candidates. Maximal degree in co-relation 3632. Up to 389 conditions per place. [2025-03-17 11:11:16,410 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-03-17 11:11:16,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 434 transitions, 1140 flow [2025-03-17 11:11:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:16,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:16,412 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 1057 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:16,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 434 transitions, 1140 flow [2025-03-17 11:11:16,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:16,419 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 1055 flow [2025-03-17 11:11:16,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-03-17 11:11:16,420 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -87 predicate places. [2025-03-17 11:11:16,420 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 1055 flow [2025-03-17 11:11:16,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.6666666666667) internal successors, (1523), 3 states have internal predecessors, (1523), 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-17 11:11:16,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:16,421 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] [2025-03-17 11:11:16,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:11:16,421 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:16,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash -67295391, now seen corresponding path program 1 times [2025-03-17 11:11:16,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:16,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764791034] [2025-03-17 11:11:16,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:16,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:16,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:11:16,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:11:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:16,447 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-17 11:11:16,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:16,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764791034] [2025-03-17 11:11:16,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764791034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:16,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:16,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:16,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5029411] [2025-03-17 11:11:16,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:16,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:16,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:16,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:16,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:16,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:16,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 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-17 11:11:16,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:16,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:16,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:17,156 INFO L124 PetriNetUnfolderBase]: 365/4235 cut-off events. [2025-03-17 11:11:17,156 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-17 11:11:17,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5998 conditions, 4235 events. 365/4235 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 41279 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5203. Up to 528 conditions per place. [2025-03-17 11:11:17,209 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2025-03-17 11:11:17,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 1140 flow [2025-03-17 11:11:17,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:17,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:17,212 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 1055 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:17,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 1140 flow [2025-03-17 11:11:17,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:17,218 INFO L231 Difference]: Finished difference. Result has 436 places, 430 transitions, 1053 flow [2025-03-17 11:11:17,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1053, PETRI_PLACES=436, PETRI_TRANSITIONS=430} [2025-03-17 11:11:17,218 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -88 predicate places. [2025-03-17 11:11:17,218 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 430 transitions, 1053 flow [2025-03-17 11:11:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.0) internal successors, (1524), 3 states have internal predecessors, (1524), 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-17 11:11:17,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:17,219 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] [2025-03-17 11:11:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:11:17,219 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:17,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:17,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1755108834, now seen corresponding path program 1 times [2025-03-17 11:11:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063681996] [2025-03-17 11:11:17,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:17,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 11:11:17,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 11:11:17,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:17,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:17,244 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-17 11:11:17,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:17,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063681996] [2025-03-17 11:11:17,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063681996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:17,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:17,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406185611] [2025-03-17 11:11:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:17,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:17,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:17,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:17,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:17,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:17,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 430 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-17 11:11:17,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:17,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:17,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:17,973 INFO L124 PetriNetUnfolderBase]: 412/4210 cut-off events. [2025-03-17 11:11:17,973 INFO L125 PetriNetUnfolderBase]: For 408/411 co-relation queries the response was YES. [2025-03-17 11:11:18,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 4210 events. 412/4210 cut-off events. For 408/411 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 40997 event pairs, 268 based on Foata normal form. 0/3904 useless extension candidates. Maximal degree in co-relation 5801. Up to 692 conditions per place. [2025-03-17 11:11:18,069 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2025-03-17 11:11:18,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 1140 flow [2025-03-17 11:11:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:18,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:18,072 INFO L175 Difference]: Start difference. First operand has 436 places, 430 transitions, 1053 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:18,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 1140 flow [2025-03-17 11:11:18,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 432 transitions, 1136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:18,079 INFO L231 Difference]: Finished difference. Result has 435 places, 429 transitions, 1051 flow [2025-03-17 11:11:18,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1051, PETRI_PLACES=435, PETRI_TRANSITIONS=429} [2025-03-17 11:11:18,080 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -89 predicate places. [2025-03-17 11:11:18,080 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 429 transitions, 1051 flow [2025-03-17 11:11:18,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 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-17 11:11:18,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:18,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:18,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:11:18,081 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:18,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash 851700175, now seen corresponding path program 1 times [2025-03-17 11:11:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:18,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072604021] [2025-03-17 11:11:18,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:18,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:11:18,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:11:18,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:18,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:18,103 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-17 11:11:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072604021] [2025-03-17 11:11:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072604021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:18,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469284382] [2025-03-17 11:11:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:18,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:18,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:18,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:18,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 429 transitions, 1051 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:11:18,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:18,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:18,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:19,232 INFO L124 PetriNetUnfolderBase]: 778/6232 cut-off events. [2025-03-17 11:11:19,232 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-17 11:11:19,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 6232 events. 778/6232 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 65432 event pairs, 545 based on Foata normal form. 0/5814 useless extension candidates. Maximal degree in co-relation 8904. Up to 1441 conditions per place. [2025-03-17 11:11:19,334 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2025-03-17 11:11:19,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 431 transitions, 1134 flow [2025-03-17 11:11:19,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:19,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:19,337 INFO L175 Difference]: Start difference. First operand has 435 places, 429 transitions, 1051 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:19,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 431 transitions, 1134 flow [2025-03-17 11:11:19,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 431 transitions, 1130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:19,344 INFO L231 Difference]: Finished difference. Result has 434 places, 428 transitions, 1049 flow [2025-03-17 11:11:19,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=428} [2025-03-17 11:11:19,344 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -90 predicate places. [2025-03-17 11:11:19,345 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 428 transitions, 1049 flow [2025-03-17 11:11:19,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:11:19,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:19,345 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] [2025-03-17 11:11:19,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:11:19,345 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:19,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash -935321996, now seen corresponding path program 1 times [2025-03-17 11:11:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606973073] [2025-03-17 11:11:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:19,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:11:19,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:11:19,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:19,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:19,370 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-17 11:11:19,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:19,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606973073] [2025-03-17 11:11:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606973073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:19,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:19,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:19,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866055394] [2025-03-17 11:11:19,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:19,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:19,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:19,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:19,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:19,463 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:19,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 428 transitions, 1049 flow. Second operand has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 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-17 11:11:19,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:19,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:19,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:19,904 INFO L124 PetriNetUnfolderBase]: 235/3275 cut-off events. [2025-03-17 11:11:19,904 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-17 11:11:19,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 3275 events. 235/3275 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 29556 event pairs, 129 based on Foata normal form. 0/3054 useless extension candidates. Maximal degree in co-relation 3656. Up to 389 conditions per place. [2025-03-17 11:11:19,967 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/430 dead transitions. [2025-03-17 11:11:19,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 430 transitions, 1132 flow [2025-03-17 11:11:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:19,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:19,969 INFO L175 Difference]: Start difference. First operand has 434 places, 428 transitions, 1049 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:19,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 430 transitions, 1132 flow [2025-03-17 11:11:19,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 430 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:19,975 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 1047 flow [2025-03-17 11:11:19,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1047, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2025-03-17 11:11:19,976 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -91 predicate places. [2025-03-17 11:11:19,976 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 1047 flow [2025-03-17 11:11:19,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.6666666666667) internal successors, (1526), 3 states have internal predecessors, (1526), 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-17 11:11:19,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:19,976 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] [2025-03-17 11:11:19,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:11:19,976 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:19,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 371652030, now seen corresponding path program 1 times [2025-03-17 11:11:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:19,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110569730] [2025-03-17 11:11:19,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:19,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:11:19,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:11:19,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:19,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,010 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-17 11:11:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110569730] [2025-03-17 11:11:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110569730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747456172] [2025-03-17 11:11:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:20,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:20,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:20,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 1047 flow. Second operand has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 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-17 11:11:20,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:20,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:20,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:20,634 INFO L124 PetriNetUnfolderBase]: 365/4187 cut-off events. [2025-03-17 11:11:20,634 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-17 11:11:20,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5950 conditions, 4187 events. 365/4187 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 40613 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5287. Up to 528 conditions per place. [2025-03-17 11:11:20,724 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2025-03-17 11:11:20,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 429 transitions, 1132 flow [2025-03-17 11:11:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:20,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:20,727 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 1047 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:20,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 429 transitions, 1132 flow [2025-03-17 11:11:20,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 429 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:20,734 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 1045 flow [2025-03-17 11:11:20,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2025-03-17 11:11:20,735 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -92 predicate places. [2025-03-17 11:11:20,735 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 1045 flow [2025-03-17 11:11:20,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.0) internal successors, (1527), 3 states have internal predecessors, (1527), 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-17 11:11:20,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:20,736 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] [2025-03-17 11:11:20,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:11:20,736 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 705015569, now seen corresponding path program 1 times [2025-03-17 11:11:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354228390] [2025-03-17 11:11:20,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:20,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:11:20,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:11:20,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:20,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:20,768 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-17 11:11:20,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:20,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354228390] [2025-03-17 11:11:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354228390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959842802] [2025-03-17 11:11:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:20,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:20,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:20,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:20,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:20,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-17 11:11:20,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:20,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:20,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:21,449 INFO L124 PetriNetUnfolderBase]: 412/4150 cut-off events. [2025-03-17 11:11:21,449 INFO L125 PetriNetUnfolderBase]: For 405/408 co-relation queries the response was YES. [2025-03-17 11:11:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5928 conditions, 4150 events. 412/4150 cut-off events. For 405/408 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 40183 event pairs, 268 based on Foata normal form. 0/3892 useless extension candidates. Maximal degree in co-relation 5777. Up to 692 conditions per place. [2025-03-17 11:11:21,527 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2025-03-17 11:11:21,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 428 transitions, 1132 flow [2025-03-17 11:11:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:21,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:21,529 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 1045 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:21,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 428 transitions, 1132 flow [2025-03-17 11:11:21,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 428 transitions, 1128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:21,534 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 1043 flow [2025-03-17 11:11:21,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2025-03-17 11:11:21,535 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -93 predicate places. [2025-03-17 11:11:21,535 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 1043 flow [2025-03-17 11:11:21,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 508.3333333333333) internal successors, (1525), 3 states have internal predecessors, (1525), 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-17 11:11:21,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:21,536 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-17 11:11:21,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:11:21,536 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash -887038096, now seen corresponding path program 1 times [2025-03-17 11:11:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545495000] [2025-03-17 11:11:21,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:21,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 11:11:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 11:11:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:21,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:21,555 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-17 11:11:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:21,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545495000] [2025-03-17 11:11:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545495000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:21,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860774739] [2025-03-17 11:11:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:21,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:21,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:21,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:21,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:11:21,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:21,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:21,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:22,709 INFO L124 PetriNetUnfolderBase]: 790/6377 cut-off events. [2025-03-17 11:11:22,709 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-17 11:11:22,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9747 conditions, 6377 events. 790/6377 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 66315 event pairs, 545 based on Foata normal form. 0/6012 useless extension candidates. Maximal degree in co-relation 9217. Up to 1441 conditions per place. [2025-03-17 11:11:22,875 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2025-03-17 11:11:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 427 transitions, 1126 flow [2025-03-17 11:11:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:22,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:22,878 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 1043 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:22,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 427 transitions, 1126 flow [2025-03-17 11:11:22,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 427 transitions, 1122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:22,885 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 1041 flow [2025-03-17 11:11:22,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-17 11:11:22,886 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -94 predicate places. [2025-03-17 11:11:22,889 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 1041 flow [2025-03-17 11:11:22,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:11:22,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:22,890 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] [2025-03-17 11:11:22,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:11:22,890 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread4Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:22,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1188185313, now seen corresponding path program 1 times [2025-03-17 11:11:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:22,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324936842] [2025-03-17 11:11:22,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:22,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 11:11:22,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 11:11:22,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:22,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:22,914 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-17 11:11:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324936842] [2025-03-17 11:11:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324936842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:22,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316473694] [2025-03-17 11:11:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:22,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:22,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:22,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:22,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:22,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 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-17 11:11:22,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:22,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:22,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:23,395 INFO L124 PetriNetUnfolderBase]: 235/3231 cut-off events. [2025-03-17 11:11:23,395 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-17 11:11:23,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4427 conditions, 3231 events. 235/3231 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 28964 event pairs, 129 based on Foata normal form. 0/3048 useless extension candidates. Maximal degree in co-relation 3816. Up to 389 conditions per place. [2025-03-17 11:11:23,446 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2025-03-17 11:11:23,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 426 transitions, 1124 flow [2025-03-17 11:11:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:23,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:23,448 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 1041 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:23,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 426 transitions, 1124 flow [2025-03-17 11:11:23,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 426 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:23,453 INFO L231 Difference]: Finished difference. Result has 429 places, 423 transitions, 1039 flow [2025-03-17 11:11:23,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1039, PETRI_PLACES=429, PETRI_TRANSITIONS=423} [2025-03-17 11:11:23,454 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -95 predicate places. [2025-03-17 11:11:23,455 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 423 transitions, 1039 flow [2025-03-17 11:11:23,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.6666666666667) internal successors, (1529), 3 states have internal predecessors, (1529), 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-17 11:11:23,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:23,455 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] [2025-03-17 11:11:23,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:11:23,455 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:23,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1819674099, now seen corresponding path program 1 times [2025-03-17 11:11:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008988941] [2025-03-17 11:11:23,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:23,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 11:11:23,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 11:11:23,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:23,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:23,473 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-17 11:11:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008988941] [2025-03-17 11:11:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008988941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464956819] [2025-03-17 11:11:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:23,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:23,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:23,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:23,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:23,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:23,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 423 transitions, 1039 flow. Second operand has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 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-17 11:11:23,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:23,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:23,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,057 INFO L124 PetriNetUnfolderBase]: 365/4139 cut-off events. [2025-03-17 11:11:24,057 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-17 11:11:24,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5902 conditions, 4139 events. 365/4139 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39945 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5371. Up to 528 conditions per place. [2025-03-17 11:11:24,129 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2025-03-17 11:11:24,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 425 transitions, 1124 flow [2025-03-17 11:11:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:24,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:24,131 INFO L175 Difference]: Start difference. First operand has 429 places, 423 transitions, 1039 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:24,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 425 transitions, 1124 flow [2025-03-17 11:11:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 425 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:24,137 INFO L231 Difference]: Finished difference. Result has 428 places, 422 transitions, 1037 flow [2025-03-17 11:11:24,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1037, PETRI_PLACES=428, PETRI_TRANSITIONS=422} [2025-03-17 11:11:24,137 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -96 predicate places. [2025-03-17 11:11:24,137 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 422 transitions, 1037 flow [2025-03-17 11:11:24,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.0) internal successors, (1530), 3 states have internal predecessors, (1530), 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-17 11:11:24,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,138 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-17 11:11:24,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:11:24,138 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:24,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash -105663282, now seen corresponding path program 1 times [2025-03-17 11:11:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350478705] [2025-03-17 11:11:24,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:11:24,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:11:24,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,162 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-17 11:11:24,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350478705] [2025-03-17 11:11:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350478705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109797256] [2025-03-17 11:11:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:24,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:24,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:24,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 422 transitions, 1037 flow. Second operand has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:11:24,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:24,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:24,811 INFO L124 PetriNetUnfolderBase]: 412/4090 cut-off events. [2025-03-17 11:11:24,812 INFO L125 PetriNetUnfolderBase]: For 402/405 co-relation queries the response was YES. [2025-03-17 11:11:24,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5868 conditions, 4090 events. 412/4090 cut-off events. For 402/405 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 39352 event pairs, 268 based on Foata normal form. 0/3880 useless extension candidates. Maximal degree in co-relation 5753. Up to 692 conditions per place. [2025-03-17 11:11:24,893 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2025-03-17 11:11:24,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 424 transitions, 1124 flow [2025-03-17 11:11:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:24,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:24,895 INFO L175 Difference]: Start difference. First operand has 428 places, 422 transitions, 1037 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:24,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 424 transitions, 1124 flow [2025-03-17 11:11:24,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 424 transitions, 1120 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:24,901 INFO L231 Difference]: Finished difference. Result has 427 places, 421 transitions, 1035 flow [2025-03-17 11:11:24,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=427, PETRI_TRANSITIONS=421} [2025-03-17 11:11:24,902 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -97 predicate places. [2025-03-17 11:11:24,902 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 421 transitions, 1035 flow [2025-03-17 11:11:24,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 509.3333333333333) internal successors, (1528), 3 states have internal predecessors, (1528), 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-17 11:11:24,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:24,902 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] [2025-03-17 11:11:24,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:11:24,902 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:24,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash 661563643, now seen corresponding path program 1 times [2025-03-17 11:11:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:24,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534171545] [2025-03-17 11:11:24,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:24,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:11:24,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:11:24,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:24,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:24,922 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-17 11:11:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534171545] [2025-03-17 11:11:24,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534171545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:24,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712534817] [2025-03-17 11:11:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:24,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:24,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:24,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:24,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:24,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:24,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 421 transitions, 1035 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-17 11:11:24,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:24,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:24,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,001 INFO L124 PetriNetUnfolderBase]: 802/6516 cut-off events. [2025-03-17 11:11:26,002 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-17 11:11:26,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 6516 events. 802/6516 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 66955 event pairs, 545 based on Foata normal form. 0/6210 useless extension candidates. Maximal degree in co-relation 9524. Up to 1441 conditions per place. [2025-03-17 11:11:26,162 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2025-03-17 11:11:26,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 423 transitions, 1118 flow [2025-03-17 11:11:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:26,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:26,164 INFO L175 Difference]: Start difference. First operand has 427 places, 421 transitions, 1035 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:26,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 423 transitions, 1118 flow [2025-03-17 11:11:26,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 423 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:26,170 INFO L231 Difference]: Finished difference. Result has 426 places, 420 transitions, 1033 flow [2025-03-17 11:11:26,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=426, PETRI_TRANSITIONS=420} [2025-03-17 11:11:26,171 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -98 predicate places. [2025-03-17 11:11:26,171 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 420 transitions, 1033 flow [2025-03-17 11:11:26,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-17 11:11:26,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,171 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-17 11:11:26,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:11:26,172 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread4Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:26,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash -761976608, now seen corresponding path program 1 times [2025-03-17 11:11:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602253154] [2025-03-17 11:11:26,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 11:11:26,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:11:26,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,192 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-17 11:11:26,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602253154] [2025-03-17 11:11:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602253154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896544731] [2025-03-17 11:11:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:26,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:26,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:26,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:26,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 420 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 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-17 11:11:26,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:26,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:26,642 INFO L124 PetriNetUnfolderBase]: 235/3187 cut-off events. [2025-03-17 11:11:26,642 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-17 11:11:26,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4383 conditions, 3187 events. 235/3187 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28513 event pairs, 129 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 3976. Up to 389 conditions per place. [2025-03-17 11:11:26,701 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2025-03-17 11:11:26,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 1116 flow [2025-03-17 11:11:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:26,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:26,703 INFO L175 Difference]: Start difference. First operand has 426 places, 420 transitions, 1033 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:26,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 1116 flow [2025-03-17 11:11:26,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 422 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:26,709 INFO L231 Difference]: Finished difference. Result has 425 places, 419 transitions, 1031 flow [2025-03-17 11:11:26,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=425, PETRI_TRANSITIONS=419} [2025-03-17 11:11:26,710 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -99 predicate places. [2025-03-17 11:11:26,710 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 419 transitions, 1031 flow [2025-03-17 11:11:26,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.6666666666667) internal successors, (1532), 3 states have internal predecessors, (1532), 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-17 11:11:26,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:26,710 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-17 11:11:26,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:11:26,710 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:26,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1605130410, now seen corresponding path program 1 times [2025-03-17 11:11:26,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:26,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313824640] [2025-03-17 11:11:26,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:26,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 11:11:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:11:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:26,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:26,729 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-17 11:11:26,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:26,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313824640] [2025-03-17 11:11:26,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313824640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:26,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:26,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640249013] [2025-03-17 11:11:26,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:26,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:26,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:26,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:26,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:26,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 419 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 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-17 11:11:26,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:26,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:26,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:27,271 INFO L124 PetriNetUnfolderBase]: 365/4091 cut-off events. [2025-03-17 11:11:27,271 INFO L125 PetriNetUnfolderBase]: For 178/187 co-relation queries the response was YES. [2025-03-17 11:11:27,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 4091 events. 365/4091 cut-off events. For 178/187 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39240 event pairs, 226 based on Foata normal form. 0/3926 useless extension candidates. Maximal degree in co-relation 5455. Up to 528 conditions per place. [2025-03-17 11:11:27,340 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 37 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2025-03-17 11:11:27,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 421 transitions, 1116 flow [2025-03-17 11:11:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:27,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:27,342 INFO L175 Difference]: Start difference. First operand has 425 places, 419 transitions, 1031 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:27,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 421 transitions, 1116 flow [2025-03-17 11:11:27,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 421 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:27,347 INFO L231 Difference]: Finished difference. Result has 424 places, 418 transitions, 1029 flow [2025-03-17 11:11:27,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1029, PETRI_PLACES=424, PETRI_TRANSITIONS=418} [2025-03-17 11:11:27,348 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -100 predicate places. [2025-03-17 11:11:27,348 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 418 transitions, 1029 flow [2025-03-17 11:11:27,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 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-17 11:11:27,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:27,348 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] [2025-03-17 11:11:27,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:11:27,348 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:27,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:27,349 INFO L85 PathProgramCache]: Analyzing trace with hash 418041277, now seen corresponding path program 1 times [2025-03-17 11:11:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603720241] [2025-03-17 11:11:27,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:27,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 11:11:27,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 11:11:27,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:27,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:27,368 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-17 11:11:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:27,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603720241] [2025-03-17 11:11:27,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603720241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:27,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:27,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204285432] [2025-03-17 11:11:27,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:27,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:27,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:27,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:27,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:27,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:27,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 418 transitions, 1029 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:11:27,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:27,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:27,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:28,006 INFO L124 PetriNetUnfolderBase]: 412/4030 cut-off events. [2025-03-17 11:11:28,006 INFO L125 PetriNetUnfolderBase]: For 399/402 co-relation queries the response was YES. [2025-03-17 11:11:28,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 4030 events. 412/4030 cut-off events. For 399/402 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 38450 event pairs, 268 based on Foata normal form. 0/3868 useless extension candidates. Maximal degree in co-relation 5729. Up to 692 conditions per place. [2025-03-17 11:11:28,088 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2025-03-17 11:11:28,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 420 transitions, 1116 flow [2025-03-17 11:11:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:28,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:28,090 INFO L175 Difference]: Start difference. First operand has 424 places, 418 transitions, 1029 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:28,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 420 transitions, 1116 flow [2025-03-17 11:11:28,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 420 transitions, 1112 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:28,095 INFO L231 Difference]: Finished difference. Result has 423 places, 417 transitions, 1027 flow [2025-03-17 11:11:28,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1027, PETRI_PLACES=423, PETRI_TRANSITIONS=417} [2025-03-17 11:11:28,096 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -101 predicate places. [2025-03-17 11:11:28,096 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 417 transitions, 1027 flow [2025-03-17 11:11:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 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-17 11:11:28,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:28,096 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] [2025-03-17 11:11:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:11:28,096 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:28,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash 19555804, now seen corresponding path program 1 times [2025-03-17 11:11:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815070806] [2025-03-17 11:11:28,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:28,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 11:11:28,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 11:11:28,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:28,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:28,116 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-17 11:11:28,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:28,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815070806] [2025-03-17 11:11:28,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815070806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:28,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:28,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:28,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546416300] [2025-03-17 11:11:28,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:28,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:28,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:28,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:28,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:28,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:28,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 417 transitions, 1027 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-17 11:11:28,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:28,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:28,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,153 INFO L124 PetriNetUnfolderBase]: 814/6649 cut-off events. [2025-03-17 11:11:29,153 INFO L125 PetriNetUnfolderBase]: For 675/681 co-relation queries the response was YES. [2025-03-17 11:11:29,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10127 conditions, 6649 events. 814/6649 cut-off events. For 675/681 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 67694 event pairs, 545 based on Foata normal form. 0/6412 useless extension candidates. Maximal degree in co-relation 9825. Up to 1441 conditions per place. [2025-03-17 11:11:29,285 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2025-03-17 11:11:29,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 419 transitions, 1110 flow [2025-03-17 11:11:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:29,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:29,287 INFO L175 Difference]: Start difference. First operand has 423 places, 417 transitions, 1027 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:29,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 419 transitions, 1110 flow [2025-03-17 11:11:29,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 419 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,293 INFO L231 Difference]: Finished difference. Result has 422 places, 416 transitions, 1025 flow [2025-03-17 11:11:29,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1025, PETRI_PLACES=422, PETRI_TRANSITIONS=416} [2025-03-17 11:11:29,293 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -102 predicate places. [2025-03-17 11:11:29,293 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 416 transitions, 1025 flow [2025-03-17 11:11:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 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-17 11:11:29,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,294 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] [2025-03-17 11:11:29,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:11:29,294 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread4Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:29,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash 793615947, now seen corresponding path program 1 times [2025-03-17 11:11:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310819385] [2025-03-17 11:11:29,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:11:29,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:11:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,315 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-17 11:11:29,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310819385] [2025-03-17 11:11:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310819385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795142571] [2025-03-17 11:11:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:29,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 416 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 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-17 11:11:29,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:29,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:29,760 INFO L124 PetriNetUnfolderBase]: 235/3143 cut-off events. [2025-03-17 11:11:29,760 INFO L125 PetriNetUnfolderBase]: For 289/293 co-relation queries the response was YES. [2025-03-17 11:11:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 3143 events. 235/3143 cut-off events. For 289/293 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 28031 event pairs, 129 based on Foata normal form. 0/3036 useless extension candidates. Maximal degree in co-relation 4136. Up to 389 conditions per place. [2025-03-17 11:11:29,814 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 36 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2025-03-17 11:11:29,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 418 transitions, 1108 flow [2025-03-17 11:11:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:29,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:29,815 INFO L175 Difference]: Start difference. First operand has 422 places, 416 transitions, 1025 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:29,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 418 transitions, 1108 flow [2025-03-17 11:11:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 418 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:29,821 INFO L231 Difference]: Finished difference. Result has 421 places, 415 transitions, 1023 flow [2025-03-17 11:11:29,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1023, PETRI_PLACES=421, PETRI_TRANSITIONS=415} [2025-03-17 11:11:29,821 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -103 predicate places. [2025-03-17 11:11:29,821 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 415 transitions, 1023 flow [2025-03-17 11:11:29,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.6666666666667) internal successors, (1535), 3 states have internal predecessors, (1535), 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-17 11:11:29,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:29,822 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] [2025-03-17 11:11:29,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:11:29,822 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:29,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:29,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2088127418, now seen corresponding path program 1 times [2025-03-17 11:11:29,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:29,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459813461] [2025-03-17 11:11:29,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:29,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 11:11:29,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 11:11:29,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:29,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:29,842 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-17 11:11:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459813461] [2025-03-17 11:11:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459813461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:29,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327859694] [2025-03-17 11:11:29,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:29,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:29,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:29,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:29,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:29,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 502 out of 547 [2025-03-17 11:11:29,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 415 transitions, 1023 flow. Second operand has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-17 11:11:29,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:29,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 502 of 547 [2025-03-17 11:11:29,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:30,481 INFO L124 PetriNetUnfolderBase]: 412/3973 cut-off events. [2025-03-17 11:11:30,482 INFO L125 PetriNetUnfolderBase]: For 401/404 co-relation queries the response was YES. [2025-03-17 11:11:30,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5761 conditions, 3973 events. 412/3973 cut-off events. For 401/404 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 37727 event pairs, 268 based on Foata normal form. 0/3856 useless extension candidates. Maximal degree in co-relation 5551. Up to 692 conditions per place. [2025-03-17 11:11:30,534 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 38 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2025-03-17 11:11:30,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 417 transitions, 1110 flow [2025-03-17 11:11:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1545 transitions. [2025-03-17 11:11:30,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414990859232175 [2025-03-17 11:11:30,535 INFO L175 Difference]: Start difference. First operand has 421 places, 415 transitions, 1023 flow. Second operand 3 states and 1545 transitions. [2025-03-17 11:11:30,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 417 transitions, 1110 flow [2025-03-17 11:11:30,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 417 transitions, 1106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:30,540 INFO L231 Difference]: Finished difference. Result has 420 places, 414 transitions, 1021 flow [2025-03-17 11:11:30,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1021, PETRI_PLACES=420, PETRI_TRANSITIONS=414} [2025-03-17 11:11:30,541 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -104 predicate places. [2025-03-17 11:11:30,541 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 414 transitions, 1021 flow [2025-03-17 11:11:30,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 511.3333333333333) internal successors, (1534), 3 states have internal predecessors, (1534), 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-17 11:11:30,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:30,541 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] [2025-03-17 11:11:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:11:30,542 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE, thread1Err19ASSERT_VIOLATIONDATA_RACE (and 199 more)] === [2025-03-17 11:11:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1364063412, now seen corresponding path program 1 times [2025-03-17 11:11:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138638147] [2025-03-17 11:11:30,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:30,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 11:11:30,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 11:11:30,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:30,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:30,563 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-17 11:11:30,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:30,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138638147] [2025-03-17 11:11:30,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138638147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:30,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:30,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:30,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390978760] [2025-03-17 11:11:30,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:30,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:30,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:30,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:30,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:30,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 503 out of 547 [2025-03-17 11:11:30,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 414 transitions, 1021 flow. Second operand has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 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-17 11:11:30,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:30,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 503 of 547 [2025-03-17 11:11:30,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:31,014 INFO L124 PetriNetUnfolderBase]: 235/3119 cut-off events. [2025-03-17 11:11:31,014 INFO L125 PetriNetUnfolderBase]: For 280/284 co-relation queries the response was YES. [2025-03-17 11:11:31,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 3119 events. 235/3119 cut-off events. For 280/284 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 27787 event pairs, 129 based on Foata normal form. 0/3030 useless extension candidates. Maximal degree in co-relation 4185. Up to 389 conditions per place. [2025-03-17 11:11:31,064 INFO L140 encePairwiseOnDemand]: 544/547 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2025-03-17 11:11:31,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 416 transitions, 1104 flow [2025-03-17 11:11:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2025-03-17 11:11:31,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9427178549664839 [2025-03-17 11:11:31,066 INFO L175 Difference]: Start difference. First operand has 420 places, 414 transitions, 1021 flow. Second operand 3 states and 1547 transitions. [2025-03-17 11:11:31,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 416 transitions, 1104 flow [2025-03-17 11:11:31,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 416 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:31,070 INFO L231 Difference]: Finished difference. Result has 419 places, 0 transitions, 0 flow [2025-03-17 11:11:31,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=547, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=419, PETRI_TRANSITIONS=0} [2025-03-17 11:11:31,070 INFO L279 CegarLoopForPetriNet]: 524 programPoint places, -105 predicate places. [2025-03-17 11:11:31,071 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 0 transitions, 0 flow [2025-03-17 11:11:31,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 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-17 11:11:31,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (202 of 203 remaining) [2025-03-17 11:11:31,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (201 of 203 remaining) [2025-03-17 11:11:31,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (200 of 203 remaining) [2025-03-17 11:11:31,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (199 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (198 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (197 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (196 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (195 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (194 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (193 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (192 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (191 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (190 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (189 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (188 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (187 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (186 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (185 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (184 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (183 of 203 remaining) [2025-03-17 11:11:31,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (182 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (181 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (180 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (179 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (178 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (177 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (176 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (175 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (174 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (173 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (172 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (171 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (170 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (169 of 203 remaining) [2025-03-17 11:11:31,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (168 of 203 remaining) [2025-03-17 11:11:31,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (167 of 203 remaining) [2025-03-17 11:11:31,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (166 of 203 remaining) [2025-03-17 11:11:31,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (165 of 203 remaining) [2025-03-17 11:11:31,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (164 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (163 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (162 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (161 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (160 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (159 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (158 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (157 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (156 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (155 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (154 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (153 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (152 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (151 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (150 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (149 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (148 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (147 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (146 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (145 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (144 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (143 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (142 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (141 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (140 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (139 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (138 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (137 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (135 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (134 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (133 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (132 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (131 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (130 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (129 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (128 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (127 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (126 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (125 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (124 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (123 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (122 of 203 remaining) [2025-03-17 11:11:31,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (121 of 203 remaining) [2025-03-17 11:11:31,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (120 of 203 remaining) [2025-03-17 11:11:31,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (119 of 203 remaining) [2025-03-17 11:11:31,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (118 of 203 remaining) [2025-03-17 11:11:31,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (117 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (116 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (115 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (114 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (113 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (112 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (111 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (110 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (109 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (108 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (107 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (106 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (105 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (104 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (103 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (102 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (101 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (100 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (99 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (98 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (97 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (96 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (94 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (93 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (92 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (91 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (90 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (89 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (88 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (87 of 203 remaining) [2025-03-17 11:11:31,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (86 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (85 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (84 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (83 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (82 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (81 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (80 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (79 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (76 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (74 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (73 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (67 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (66 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (65 of 203 remaining) [2025-03-17 11:11:31,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (64 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (63 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (62 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (61 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (60 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (59 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (58 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (57 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (56 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (55 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (54 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (51 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (46 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (45 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (44 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (43 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (42 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (41 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (40 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (39 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (38 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (37 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (36 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (35 of 203 remaining) [2025-03-17 11:11:31,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (34 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (33 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (32 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (30 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (29 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (28 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (27 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (23 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err22ASSERT_VIOLATIONDATA_RACE (22 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (21 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (20 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 203 remaining) [2025-03-17 11:11:31,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 203 remaining) [2025-03-17 11:11:31,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:11:31,086 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:31,093 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:11:31,093 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:11:31,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:11:31 BasicIcfg [2025-03-17 11:11:31,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:11:31,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:11:31,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:11:31,099 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:11:31,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:10:59" (3/4) ... [2025-03-17 11:11:31,101 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:11:31,103 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:11:31,103 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:11:31,103 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:11:31,103 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-17 11:11:31,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 11:11:31,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:11:31,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:11:31,108 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:11:31,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:11:31,174 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:11:31,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:11:31,175 INFO L158 Benchmark]: Toolchain (without parser) took 32125.87ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 105.9MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 592.8MB. Max. memory is 16.1GB. [2025-03-17 11:11:31,175 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:31,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.45ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:31,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.36ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:31,176 INFO L158 Benchmark]: Boogie Preprocessor took 37.40ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 998.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:11:31,176 INFO L158 Benchmark]: IcfgBuilder took 666.18ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 57.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 11:11:31,176 INFO L158 Benchmark]: TraceAbstraction took 31137.54ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 56.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 534.1MB. Max. memory is 16.1GB. [2025-03-17 11:11:31,177 INFO L158 Benchmark]: Witness Printer took 74.77ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:11:31,177 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.45ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.36ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 91.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.40ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 998.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 666.18ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 57.6MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31137.54ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 56.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 534.1MB. Max. memory is 16.1GB. * Witness Printer took 74.77ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: 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: 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: 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: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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 9 procedures, 918 locations, 939 edges, 203 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: 31.0s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5794 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1900 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5459 IncrementalHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 976 mSDtfsCounter, 5459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1073occurred in iteration=12, InterpolantAutomatonStates: 119, 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 4063 NumberOfCodeBlocks, 4063 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4024 ConstructedInterpolants, 0 QuantifiedInterpolants, 4102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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 107 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:11:31,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE