./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:54,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:54,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:42:54,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:54,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:54,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:54,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:54,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:54,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:54,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:54,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:54,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:54,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:54,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:54,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:54,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:54,226 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2025-03-14 01:42:54,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:54,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:54,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:54,491 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:54,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:54,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-14 01:42:55,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9626d1060/cdaa55303bab4fee8ad900e0547cc13c/FLAG8975af950 [2025-03-14 01:42:55,933 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:55,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-14 01:42:55,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9626d1060/cdaa55303bab4fee8ad900e0547cc13c/FLAG8975af950 [2025-03-14 01:42:56,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9626d1060/cdaa55303bab4fee8ad900e0547cc13c [2025-03-14 01:42:56,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:56,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:56,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:56,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:56,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:56,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b75528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56, skipping insertion in model container [2025-03-14 01:42:56,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:56,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:56,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:56,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:56,511 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:56,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56 WrapperNode [2025-03-14 01:42:56,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:56,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:56,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:56,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:56,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,567 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 585 [2025-03-14 01:42:56,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:56,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:56,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:56,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:56,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:56,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:56,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:56,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:56,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (1/1) ... [2025-03-14 01:42:56,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:56,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:56,650 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-14 01:42:56,653 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-14 01:42:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:56,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:56,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:56,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:56,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:42:56,672 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:42:56,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:56,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:57,351 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:57,351 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:57,351 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:57,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:57,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:57 BoogieIcfgContainer [2025-03-14 01:42:57,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:57,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:57,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:57,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:57,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:56" (1/3) ... [2025-03-14 01:42:57,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dfb8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:57, skipping insertion in model container [2025-03-14 01:42:57,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:56" (2/3) ... [2025-03-14 01:42:57,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dfb8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:57, skipping insertion in model container [2025-03-14 01:42:57,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:57" (3/3) ... [2025-03-14 01:42:57,399 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-03-14 01:42:57,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:57,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 734 locations, 1 initial locations, 3 loop locations, and 102 error locations. [2025-03-14 01:42:57,411 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:57,550 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:42:57,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 740 places, 773 transitions, 1560 flow [2025-03-14 01:42:57,842 INFO L124 PetriNetUnfolderBase]: 40/771 cut-off events. [2025-03-14 01:42:57,846 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:57,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 771 events. 40/771 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2085 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2025-03-14 01:42:57,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 773 transitions, 1560 flow [2025-03-14 01:42:57,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 749 transitions, 1510 flow [2025-03-14 01:42:57,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:57,891 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;@6e35eb8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:57,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2025-03-14 01:42:57,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:57,898 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-03-14 01:42:57,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:57,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:57,899 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] [2025-03-14 01:42:57,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:42:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 553952520, now seen corresponding path program 1 times [2025-03-14 01:42:57,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789109023] [2025-03-14 01:42:57,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:58,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:42:58,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:42:58,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:58,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:58,076 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-14 01:42:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789109023] [2025-03-14 01:42:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789109023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:58,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:58,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:58,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546955124] [2025-03-14 01:42:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:58,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:58,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:58,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:58,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:42:58,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 749 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:42:58,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:58,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:42:58,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:58,657 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2025-03-14 01:42:58,657 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2025-03-14 01:42:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 2402 events. 133/2402 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15195 event pairs, 35 based on Foata normal form. 65/1970 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2025-03-14 01:42:58,684 INFO L140 encePairwiseOnDemand]: 758/773 looper letters, 17 selfloop transitions, 2 changer transitions 2/736 dead transitions. [2025-03-14 01:42:58,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1522 flow [2025-03-14 01:42:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2246 transitions. [2025-03-14 01:42:58,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9685209141871496 [2025-03-14 01:42:58,711 INFO L175 Difference]: Start difference. First operand has 718 places, 749 transitions, 1510 flow. Second operand 3 states and 2246 transitions. [2025-03-14 01:42:58,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1522 flow [2025-03-14 01:42:58,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 736 transitions, 1514 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:42:58,733 INFO L231 Difference]: Finished difference. Result has 715 places, 734 transitions, 1476 flow [2025-03-14 01:42:58,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=715, PETRI_TRANSITIONS=734} [2025-03-14 01:42:58,741 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -3 predicate places. [2025-03-14 01:42:58,742 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 734 transitions, 1476 flow [2025-03-14 01:42:58,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:42:58,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:58,745 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-14 01:42:58,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:58,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:42:58,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1382719609, now seen corresponding path program 1 times [2025-03-14 01:42:58,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098753403] [2025-03-14 01:42:58,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:58,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:42:58,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:42:58,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:58,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:58,794 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-14 01:42:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098753403] [2025-03-14 01:42:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098753403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783538942] [2025-03-14 01:42:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:58,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:58,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:58,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:58,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:42:58,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:42:58,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:58,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:42:58,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:59,283 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2025-03-14 01:42:59,283 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-14 01:42:59,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2402 events. 133/2402 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14772 event pairs, 35 based on Foata normal form. 0/1902 useless extension candidates. Maximal degree in co-relation 2467. Up to 88 conditions per place. [2025-03-14 01:42:59,322 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2025-03-14 01:42:59,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2025-03-14 01:42:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2025-03-14 01:42:59,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633462699439413 [2025-03-14 01:42:59,328 INFO L175 Difference]: Start difference. First operand has 715 places, 734 transitions, 1476 flow. Second operand 3 states and 2234 transitions. [2025-03-14 01:42:59,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2025-03-14 01:42:59,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:59,342 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2025-03-14 01:42:59,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2025-03-14 01:42:59,343 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -6 predicate places. [2025-03-14 01:42:59,343 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2025-03-14 01:42:59,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:42:59,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:59,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] [2025-03-14 01:42:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:59,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:42:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 78190454, now seen corresponding path program 1 times [2025-03-14 01:42:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-14 01:42:59,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:59,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-14 01:42:59,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-14 01:42:59,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:59,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:59,409 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-14 01:42:59,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:59,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662798246] [2025-03-14 01:42:59,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662798246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:59,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:59,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:59,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438232413] [2025-03-14 01:42:59,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:59,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:59,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:59,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:59,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:59,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:42:59,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:42:59,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:59,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:42:59,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:59,799 INFO L124 PetriNetUnfolderBase]: 130/2940 cut-off events. [2025-03-14 01:42:59,799 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-14 01:42:59,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2940 events. 130/2940 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17987 event pairs, 8 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 2946. Up to 34 conditions per place. [2025-03-14 01:42:59,825 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2025-03-14 01:42:59,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1510 flow [2025-03-14 01:42:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2025-03-14 01:42:59,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633462699439413 [2025-03-14 01:42:59,829 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2234 transitions. [2025-03-14 01:42:59,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1510 flow [2025-03-14 01:42:59,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:59,838 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2025-03-14 01:42:59,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2025-03-14 01:42:59,840 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -7 predicate places. [2025-03-14 01:42:59,840 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2025-03-14 01:42:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:42:59,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:59,842 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] [2025-03-14 01:42:59,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:59,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:42:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 318210128, now seen corresponding path program 1 times [2025-03-14 01:42:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58002513] [2025-03-14 01:42:59,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:59,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-14 01:42:59,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-14 01:42:59,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:59,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:59,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-14 01:42:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58002513] [2025-03-14 01:42:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58002513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821167350] [2025-03-14 01:42:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:59,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:59,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:59,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 773 [2025-03-14 01:42:59,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-14 01:42:59,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:59,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 773 [2025-03-14 01:42:59,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:00,088 INFO L124 PetriNetUnfolderBase]: 44/1006 cut-off events. [2025-03-14 01:43:00,089 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:43:00,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 1006 events. 44/1006 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3914 event pairs, 6 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 994. Up to 26 conditions per place. [2025-03-14 01:43:00,108 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2025-03-14 01:43:00,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1500 flow [2025-03-14 01:43:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2025-03-14 01:43:00,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667960327727468 [2025-03-14 01:43:00,112 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2242 transitions. [2025-03-14 01:43:00,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1500 flow [2025-03-14 01:43:00,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:00,121 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2025-03-14 01:43:00,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2025-03-14 01:43:00,123 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -8 predicate places. [2025-03-14 01:43:00,123 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2025-03-14 01:43:00,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-14 01:43:00,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:00,124 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] [2025-03-14 01:43:00,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:43:00,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:00,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash 259903292, now seen corresponding path program 1 times [2025-03-14 01:43:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-03-14 01:43:00,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:00,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-14 01:43:00,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-14 01:43:00,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:00,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:00,182 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-14 01:43:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-03-14 01:43:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514555879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:00,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326257952] [2025-03-14 01:43:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:00,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:00,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:00,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:00,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:00,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-03-14 01:43:00,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-14 01:43:00,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:00,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-03-14 01:43:00,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:00,439 INFO L124 PetriNetUnfolderBase]: 91/2110 cut-off events. [2025-03-14 01:43:00,439 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-14 01:43:00,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 2110 events. 91/2110 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10642 event pairs, 5 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2086. Up to 23 conditions per place. [2025-03-14 01:43:00,456 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 12 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2025-03-14 01:43:00,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1496 flow [2025-03-14 01:43:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2025-03-14 01:43:00,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9676584734799483 [2025-03-14 01:43:00,460 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2244 transitions. [2025-03-14 01:43:00,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1496 flow [2025-03-14 01:43:00,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:00,467 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2025-03-14 01:43:00,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2025-03-14 01:43:00,469 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -9 predicate places. [2025-03-14 01:43:00,469 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2025-03-14 01:43:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-14 01:43:00,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:00,470 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] [2025-03-14 01:43:00,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:43:00,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:00,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1072388714, now seen corresponding path program 1 times [2025-03-14 01:43:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-03-14 01:43:00,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:00,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-14 01:43:00,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-14 01:43:00,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:00,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:00,530 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-14 01:43:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-03-14 01:43:00,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45589607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630329317] [2025-03-14 01:43:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:00,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:00,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:00,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:00,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 773 [2025-03-14 01:43:00,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-14 01:43:00,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:00,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 773 [2025-03-14 01:43:00,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:01,071 INFO L124 PetriNetUnfolderBase]: 182/4041 cut-off events. [2025-03-14 01:43:01,072 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-14 01:43:01,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 4041 events. 182/4041 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 28109 event pairs, 12 based on Foata normal form. 0/3194 useless extension candidates. Maximal degree in co-relation 4037. Up to 44 conditions per place. [2025-03-14 01:43:01,102 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2025-03-14 01:43:01,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1508 flow [2025-03-14 01:43:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2025-03-14 01:43:01,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616213885295386 [2025-03-14 01:43:01,107 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2025-03-14 01:43:01,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1508 flow [2025-03-14 01:43:01,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:01,117 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2025-03-14 01:43:01,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2025-03-14 01:43:01,119 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -10 predicate places. [2025-03-14 01:43:01,119 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2025-03-14 01:43:01,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-14 01:43:01,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:01,121 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] [2025-03-14 01:43:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:43:01,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:01,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash 438629426, now seen corresponding path program 1 times [2025-03-14 01:43:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615880761] [2025-03-14 01:43:01,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-14 01:43:01,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-14 01:43:01,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:01,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:01,160 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-14 01:43:01,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615880761] [2025-03-14 01:43:01,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615880761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:01,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:01,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164923263] [2025-03-14 01:43:01,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:01,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:01,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:01,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:01,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:01,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:01,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:43:01,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:01,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:01,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:01,397 INFO L124 PetriNetUnfolderBase]: 46/987 cut-off events. [2025-03-14 01:43:01,397 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-14 01:43:01,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 987 events. 46/987 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3810 event pairs, 8 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 954. Up to 35 conditions per place. [2025-03-14 01:43:01,416 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2025-03-14 01:43:01,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1502 flow [2025-03-14 01:43:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2025-03-14 01:43:01,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633462699439413 [2025-03-14 01:43:01,422 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2234 transitions. [2025-03-14 01:43:01,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1502 flow [2025-03-14 01:43:01,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:01,435 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2025-03-14 01:43:01,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2025-03-14 01:43:01,437 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -11 predicate places. [2025-03-14 01:43:01,437 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2025-03-14 01:43:01,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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-14 01:43:01,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:01,438 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] [2025-03-14 01:43:01,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:43:01,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:01,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 13444227, now seen corresponding path program 1 times [2025-03-14 01:43:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436671340] [2025-03-14 01:43:01,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:01,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-14 01:43:01,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-14 01:43:01,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:01,477 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-14 01:43:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:01,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436671340] [2025-03-14 01:43:01,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436671340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:01,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:01,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134291215] [2025-03-14 01:43:01,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:01,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:01,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:01,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:01,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:01,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 773 [2025-03-14 01:43:01,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-14 01:43:01,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:01,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 773 [2025-03-14 01:43:01,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:01,631 INFO L124 PetriNetUnfolderBase]: 44/1002 cut-off events. [2025-03-14 01:43:01,632 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-14 01:43:01,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 1002 events. 44/1002 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3613 event pairs, 6 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 952. Up to 26 conditions per place. [2025-03-14 01:43:01,651 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2025-03-14 01:43:01,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1492 flow [2025-03-14 01:43:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2025-03-14 01:43:01,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667960327727468 [2025-03-14 01:43:01,655 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2242 transitions. [2025-03-14 01:43:01,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1492 flow [2025-03-14 01:43:01,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:01,697 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2025-03-14 01:43:01,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2025-03-14 01:43:01,699 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2025-03-14 01:43:01,699 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2025-03-14 01:43:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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-14 01:43:01,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:01,701 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] [2025-03-14 01:43:01,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:43:01,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1299642980, now seen corresponding path program 1 times [2025-03-14 01:43:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:01,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174655211] [2025-03-14 01:43:01,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:01,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:43:01,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:43:01,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:01,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:01,741 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-14 01:43:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174655211] [2025-03-14 01:43:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174655211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986934271] [2025-03-14 01:43:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:01,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:01,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:01,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:01,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-03-14 01:43:01,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-14 01:43:01,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:01,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-03-14 01:43:01,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:01,865 INFO L124 PetriNetUnfolderBase]: 31/736 cut-off events. [2025-03-14 01:43:01,865 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-14 01:43:01,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 736 events. 31/736 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2485 event pairs, 5 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 675. Up to 23 conditions per place. [2025-03-14 01:43:01,881 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 12 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2025-03-14 01:43:01,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1488 flow [2025-03-14 01:43:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2025-03-14 01:43:01,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9676584734799483 [2025-03-14 01:43:01,885 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2244 transitions. [2025-03-14 01:43:01,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1488 flow [2025-03-14 01:43:01,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:01,895 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2025-03-14 01:43:01,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2025-03-14 01:43:01,897 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2025-03-14 01:43:01,897 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2025-03-14 01:43:01,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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-14 01:43:01,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:01,898 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] [2025-03-14 01:43:01,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:43:01,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1287765840, now seen corresponding path program 1 times [2025-03-14 01:43:01,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:01,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219149586] [2025-03-14 01:43:01,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:01,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:01,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-14 01:43:01,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-14 01:43:01,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:01,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:01,942 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-14 01:43:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219149586] [2025-03-14 01:43:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219149586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:01,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144283120] [2025-03-14 01:43:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:01,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:01,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:01,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:02,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 773 [2025-03-14 01:43:02,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-14 01:43:02,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:02,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 773 [2025-03-14 01:43:02,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:02,135 INFO L124 PetriNetUnfolderBase]: 50/1000 cut-off events. [2025-03-14 01:43:02,135 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-03-14 01:43:02,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1000 events. 50/1000 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4099 event pairs, 12 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 952. Up to 44 conditions per place. [2025-03-14 01:43:02,152 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2025-03-14 01:43:02,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 725 transitions, 1500 flow [2025-03-14 01:43:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2025-03-14 01:43:02,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616213885295386 [2025-03-14 01:43:02,156 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 3 states and 2230 transitions. [2025-03-14 01:43:02,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 725 transitions, 1500 flow [2025-03-14 01:43:02,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 725 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:02,165 INFO L231 Difference]: Finished difference. Result has 704 places, 725 transitions, 1458 flow [2025-03-14 01:43:02,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=704, PETRI_TRANSITIONS=725} [2025-03-14 01:43:02,167 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -14 predicate places. [2025-03-14 01:43:02,167 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 725 transitions, 1458 flow [2025-03-14 01:43:02,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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-14 01:43:02,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:02,169 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] [2025-03-14 01:43:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:43:02,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -677332972, now seen corresponding path program 1 times [2025-03-14 01:43:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051041327] [2025-03-14 01:43:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:02,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-14 01:43:02,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-14 01:43:02,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:02,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:02,258 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-14 01:43:02,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051041327] [2025-03-14 01:43:02,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051041327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:02,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448570883] [2025-03-14 01:43:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:02,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:02,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:02,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-03-14 01:43:02,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 725 transitions, 1458 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-14 01:43:02,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:02,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-03-14 01:43:02,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:02,411 INFO L124 PetriNetUnfolderBase]: 52/1223 cut-off events. [2025-03-14 01:43:02,412 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-14 01:43:02,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 1223 events. 52/1223 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4287 event pairs, 3 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1142. Up to 18 conditions per place. [2025-03-14 01:43:02,431 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 9 selfloop transitions, 2 changer transitions 0/724 dead transitions. [2025-03-14 01:43:02,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 724 transitions, 1478 flow [2025-03-14 01:43:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2025-03-14 01:43:02,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9702457956015524 [2025-03-14 01:43:02,437 INFO L175 Difference]: Start difference. First operand has 704 places, 725 transitions, 1458 flow. Second operand 3 states and 2250 transitions. [2025-03-14 01:43:02,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 724 transitions, 1478 flow [2025-03-14 01:43:02,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 724 transitions, 1474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:02,445 INFO L231 Difference]: Finished difference. Result has 703 places, 724 transitions, 1456 flow [2025-03-14 01:43:02,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=703, PETRI_TRANSITIONS=724} [2025-03-14 01:43:02,447 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -15 predicate places. [2025-03-14 01:43:02,447 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 724 transitions, 1456 flow [2025-03-14 01:43:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-14 01:43:02,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:02,449 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] [2025-03-14 01:43:02,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:43:02,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:02,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1002896680, now seen corresponding path program 1 times [2025-03-14 01:43:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921956617] [2025-03-14 01:43:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:02,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-14 01:43:02,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-14 01:43:02,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:02,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:02,987 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-14 01:43:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921956617] [2025-03-14 01:43:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921956617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:02,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:02,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:43:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603666649] [2025-03-14 01:43:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:02,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:43:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:02,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:43:02,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:43:03,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 773 [2025-03-14 01:43:03,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 724 transitions, 1456 flow. Second operand has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 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-14 01:43:03,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:03,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 773 [2025-03-14 01:43:03,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:03,370 INFO L124 PetriNetUnfolderBase]: 131/2346 cut-off events. [2025-03-14 01:43:03,370 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-14 01:43:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 2346 events. 131/2346 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 13173 event pairs, 24 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2278. Up to 84 conditions per place. [2025-03-14 01:43:03,389 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 20 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-03-14 01:43:03,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 723 transitions, 1504 flow [2025-03-14 01:43:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:43:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:43:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4424 transitions. [2025-03-14 01:43:03,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538594221647262 [2025-03-14 01:43:03,396 INFO L175 Difference]: Start difference. First operand has 703 places, 724 transitions, 1456 flow. Second operand 6 states and 4424 transitions. [2025-03-14 01:43:03,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 723 transitions, 1504 flow [2025-03-14 01:43:03,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 723 transitions, 1500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:03,402 INFO L231 Difference]: Finished difference. Result has 705 places, 723 transitions, 1460 flow [2025-03-14 01:43:03,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=723} [2025-03-14 01:43:03,403 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2025-03-14 01:43:03,404 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 723 transitions, 1460 flow [2025-03-14 01:43:03,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 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-14 01:43:03,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:03,406 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-14 01:43:03,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:43:03,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:03,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash -383781771, now seen corresponding path program 1 times [2025-03-14 01:43:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:03,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829842769] [2025-03-14 01:43:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:03,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-14 01:43:03,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:43:03,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:03,457 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-14 01:43:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:03,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829842769] [2025-03-14 01:43:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829842769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:03,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018783340] [2025-03-14 01:43:03,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:03,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:03,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:03,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:03,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-03-14 01:43:03,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 723 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 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-14 01:43:03,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:03,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-03-14 01:43:03,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:03,628 INFO L124 PetriNetUnfolderBase]: 59/1274 cut-off events. [2025-03-14 01:43:03,628 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2025-03-14 01:43:03,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1274 events. 59/1274 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5954 event pairs, 2 based on Foata normal form. 1/1034 useless extension candidates. Maximal degree in co-relation 1307. Up to 27 conditions per place. [2025-03-14 01:43:03,647 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2025-03-14 01:43:03,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 723 transitions, 1491 flow [2025-03-14 01:43:03,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2025-03-14 01:43:03,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969383354894351 [2025-03-14 01:43:03,652 INFO L175 Difference]: Start difference. First operand has 705 places, 723 transitions, 1460 flow. Second operand 3 states and 2248 transitions. [2025-03-14 01:43:03,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 723 transitions, 1491 flow [2025-03-14 01:43:03,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1481 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:43:03,663 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2025-03-14 01:43:03,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2025-03-14 01:43:03,666 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -17 predicate places. [2025-03-14 01:43:03,666 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2025-03-14 01:43:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 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-14 01:43:03,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:03,668 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] [2025-03-14 01:43:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:43:03,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:03,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1861399135, now seen corresponding path program 1 times [2025-03-14 01:43:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920296806] [2025-03-14 01:43:03,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:03,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-14 01:43:03,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-14 01:43:03,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:03,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:03,724 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-14 01:43:03,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920296806] [2025-03-14 01:43:03,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920296806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470396107] [2025-03-14 01:43:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:03,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:03,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:03,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:03,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:03,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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-14 01:43:03,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:03,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:03,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:03,915 INFO L124 PetriNetUnfolderBase]: 65/1273 cut-off events. [2025-03-14 01:43:03,916 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2025-03-14 01:43:03,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1273 events. 65/1273 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5994 event pairs, 13 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 1178. Up to 45 conditions per place. [2025-03-14 01:43:03,934 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2025-03-14 01:43:03,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1495 flow [2025-03-14 01:43:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2025-03-14 01:43:03,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642087106511428 [2025-03-14 01:43:03,940 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2236 transitions. [2025-03-14 01:43:03,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1495 flow [2025-03-14 01:43:03,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:03,948 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2025-03-14 01:43:03,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=700, PETRI_TRANSITIONS=721} [2025-03-14 01:43:03,950 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -18 predicate places. [2025-03-14 01:43:03,951 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2025-03-14 01:43:03,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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-14 01:43:03,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:03,955 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-14 01:43:03,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:43:03,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:03,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 521420001, now seen corresponding path program 1 times [2025-03-14 01:43:03,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:03,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130870248] [2025-03-14 01:43:03,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:03,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:03,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-14 01:43:03,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-14 01:43:03,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:03,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:03,991 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-14 01:43:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130870248] [2025-03-14 01:43:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130870248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582670899] [2025-03-14 01:43:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:03,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:03,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:03,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:04,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-03-14 01:43:04,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 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-14 01:43:04,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:04,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-03-14 01:43:04,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:04,119 INFO L124 PetriNetUnfolderBase]: 47/998 cut-off events. [2025-03-14 01:43:04,120 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-14 01:43:04,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 998 events. 47/998 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3609 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 865. Up to 27 conditions per place. [2025-03-14 01:43:04,133 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2025-03-14 01:43:04,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 721 transitions, 1481 flow [2025-03-14 01:43:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2025-03-14 01:43:04,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969383354894351 [2025-03-14 01:43:04,137 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2248 transitions. [2025-03-14 01:43:04,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 721 transitions, 1481 flow [2025-03-14 01:43:04,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 721 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:04,144 INFO L231 Difference]: Finished difference. Result has 699 places, 720 transitions, 1448 flow [2025-03-14 01:43:04,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=699, PETRI_TRANSITIONS=720} [2025-03-14 01:43:04,145 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -19 predicate places. [2025-03-14 01:43:04,145 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 720 transitions, 1448 flow [2025-03-14 01:43:04,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 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-14 01:43:04,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:04,146 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] [2025-03-14 01:43:04,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:43:04,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:04,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash 620389466, now seen corresponding path program 1 times [2025-03-14 01:43:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429085961] [2025-03-14 01:43:04,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-14 01:43:04,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:43:04,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:04,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:04,185 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-14 01:43:04,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:04,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429085961] [2025-03-14 01:43:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429085961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981288345] [2025-03-14 01:43:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:04,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:04,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:04,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:04,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 773 [2025-03-14 01:43:04,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 720 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-14 01:43:04,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:04,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 773 [2025-03-14 01:43:04,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:04,744 INFO L124 PetriNetUnfolderBase]: 383/5332 cut-off events. [2025-03-14 01:43:04,745 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:43:04,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 5332 events. 383/5332 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 40992 event pairs, 100 based on Foata normal form. 0/4262 useless extension candidates. Maximal degree in co-relation 5179. Up to 296 conditions per place. [2025-03-14 01:43:04,779 INFO L140 encePairwiseOnDemand]: 761/773 looper letters, 26 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2025-03-14 01:43:04,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1491 flow [2025-03-14 01:43:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2025-03-14 01:43:04,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529969814575248 [2025-03-14 01:43:04,784 INFO L175 Difference]: Start difference. First operand has 699 places, 720 transitions, 1448 flow. Second operand 3 states and 2210 transitions. [2025-03-14 01:43:04,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1491 flow [2025-03-14 01:43:04,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:04,798 INFO L231 Difference]: Finished difference. Result has 690 places, 712 transitions, 1438 flow [2025-03-14 01:43:04,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=690, PETRI_TRANSITIONS=712} [2025-03-14 01:43:04,799 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -28 predicate places. [2025-03-14 01:43:04,799 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 712 transitions, 1438 flow [2025-03-14 01:43:04,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-14 01:43:04,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:04,800 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] [2025-03-14 01:43:04,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:43:04,800 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:04,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:04,801 INFO L85 PathProgramCache]: Analyzing trace with hash -806128293, now seen corresponding path program 1 times [2025-03-14 01:43:04,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:04,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608751534] [2025-03-14 01:43:04,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:04,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-14 01:43:04,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-14 01:43:04,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:04,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:04,854 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-14 01:43:04,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:04,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608751534] [2025-03-14 01:43:04,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608751534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:04,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:04,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377582515] [2025-03-14 01:43:04,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:04,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:04,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:04,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:04,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:04,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 773 [2025-03-14 01:43:04,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 712 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-14 01:43:04,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:04,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 773 [2025-03-14 01:43:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:05,444 INFO L124 PetriNetUnfolderBase]: 398/5526 cut-off events. [2025-03-14 01:43:05,445 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:43:05,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 5526 events. 398/5526 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43133 event pairs, 100 based on Foata normal form. 0/4483 useless extension candidates. Maximal degree in co-relation 5425. Up to 304 conditions per place. [2025-03-14 01:43:05,488 INFO L140 encePairwiseOnDemand]: 761/773 looper letters, 26 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2025-03-14 01:43:05,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 705 transitions, 1481 flow [2025-03-14 01:43:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2025-03-14 01:43:05,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529969814575248 [2025-03-14 01:43:05,491 INFO L175 Difference]: Start difference. First operand has 690 places, 712 transitions, 1438 flow. Second operand 3 states and 2210 transitions. [2025-03-14 01:43:05,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 705 transitions, 1481 flow [2025-03-14 01:43:05,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 705 transitions, 1481 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:05,545 INFO L231 Difference]: Finished difference. Result has 683 places, 704 transitions, 1432 flow [2025-03-14 01:43:05,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=683, PETRI_TRANSITIONS=704} [2025-03-14 01:43:05,546 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -35 predicate places. [2025-03-14 01:43:05,546 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 704 transitions, 1432 flow [2025-03-14 01:43:05,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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-14 01:43:05,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:05,546 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] [2025-03-14 01:43:05,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:43:05,547 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:05,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:05,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1987598664, now seen corresponding path program 1 times [2025-03-14 01:43:05,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:05,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667241304] [2025-03-14 01:43:05,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:05,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:05,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:43:05,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:43:05,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:05,587 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-14 01:43:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:05,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667241304] [2025-03-14 01:43:05,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667241304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438969946] [2025-03-14 01:43:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:05,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:05,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:05,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:05,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:05,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 704 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-14 01:43:05,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:05,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:05,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:05,773 INFO L124 PetriNetUnfolderBase]: 79/1465 cut-off events. [2025-03-14 01:43:05,774 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-03-14 01:43:05,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1465 events. 79/1465 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7724 event pairs, 2 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1122. Up to 67 conditions per place. [2025-03-14 01:43:05,792 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 19 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2025-03-14 01:43:05,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 704 transitions, 1475 flow [2025-03-14 01:43:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2025-03-14 01:43:05,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9642087106511428 [2025-03-14 01:43:05,795 INFO L175 Difference]: Start difference. First operand has 683 places, 704 transitions, 1432 flow. Second operand 3 states and 2236 transitions. [2025-03-14 01:43:05,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 704 transitions, 1475 flow [2025-03-14 01:43:05,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 704 transitions, 1475 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:05,802 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1434 flow [2025-03-14 01:43:05,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=684, PETRI_TRANSITIONS=703} [2025-03-14 01:43:05,803 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -34 predicate places. [2025-03-14 01:43:05,803 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1434 flow [2025-03-14 01:43:05,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-14 01:43:05,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:05,804 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] [2025-03-14 01:43:05,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:43:05,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:05,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:05,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2090667783, now seen corresponding path program 1 times [2025-03-14 01:43:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:05,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992132985] [2025-03-14 01:43:05,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:05,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-14 01:43:05,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-14 01:43:05,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:05,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:05,835 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-14 01:43:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992132985] [2025-03-14 01:43:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992132985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:05,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766632866] [2025-03-14 01:43:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:05,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:05,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:05,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:05,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2025-03-14 01:43:05,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 703 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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-14 01:43:05,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:05,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2025-03-14 01:43:05,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:06,056 INFO L124 PetriNetUnfolderBase]: 116/2291 cut-off events. [2025-03-14 01:43:06,056 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-14 01:43:06,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 2291 events. 116/2291 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12475 event pairs, 4 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 1968. Up to 28 conditions per place. [2025-03-14 01:43:06,077 INFO L140 encePairwiseOnDemand]: 758/773 looper letters, 17 selfloop transitions, 9 changer transitions 0/702 dead transitions. [2025-03-14 01:43:06,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 702 transitions, 1485 flow [2025-03-14 01:43:06,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-03-14 01:43:06,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607589478223372 [2025-03-14 01:43:06,080 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1434 flow. Second operand 3 states and 2228 transitions. [2025-03-14 01:43:06,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 702 transitions, 1485 flow [2025-03-14 01:43:06,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 702 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:06,087 INFO L231 Difference]: Finished difference. Result has 679 places, 701 transitions, 1461 flow [2025-03-14 01:43:06,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=679, PETRI_TRANSITIONS=701} [2025-03-14 01:43:06,088 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2025-03-14 01:43:06,088 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 701 transitions, 1461 flow [2025-03-14 01:43:06,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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-14 01:43:06,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:06,089 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] [2025-03-14 01:43:06,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:43:06,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:06,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1735112865, now seen corresponding path program 1 times [2025-03-14 01:43:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753749251] [2025-03-14 01:43:06,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:06,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-14 01:43:06,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-14 01:43:06,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:06,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:06,124 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-14 01:43:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753749251] [2025-03-14 01:43:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753749251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346586067] [2025-03-14 01:43:06,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:06,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:06,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:06,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:06,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 701 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-14 01:43:06,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:06,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:06,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:06,352 INFO L124 PetriNetUnfolderBase]: 112/2245 cut-off events. [2025-03-14 01:43:06,352 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2025-03-14 01:43:06,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 2245 events. 112/2245 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 14431 event pairs, 10 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 1941. Up to 44 conditions per place. [2025-03-14 01:43:06,368 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 20 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2025-03-14 01:43:06,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 701 transitions, 1508 flow [2025-03-14 01:43:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2025-03-14 01:43:06,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659335920655455 [2025-03-14 01:43:06,371 INFO L175 Difference]: Start difference. First operand has 679 places, 701 transitions, 1461 flow. Second operand 3 states and 2240 transitions. [2025-03-14 01:43:06,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 701 transitions, 1508 flow [2025-03-14 01:43:06,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 701 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:06,377 INFO L231 Difference]: Finished difference. Result has 679 places, 700 transitions, 1456 flow [2025-03-14 01:43:06,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=679, PETRI_TRANSITIONS=700} [2025-03-14 01:43:06,378 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2025-03-14 01:43:06,378 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 700 transitions, 1456 flow [2025-03-14 01:43:06,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-14 01:43:06,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:06,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:06,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:43:06,380 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash 228153200, now seen corresponding path program 1 times [2025-03-14 01:43:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:06,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468824238] [2025-03-14 01:43:06,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:06,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-14 01:43:06,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-14 01:43:06,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:06,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:06,415 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-14 01:43:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468824238] [2025-03-14 01:43:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468824238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:06,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:06,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580509314] [2025-03-14 01:43:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:06,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:06,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:06,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 773 [2025-03-14 01:43:06,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 700 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 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-14 01:43:06,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:06,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 773 [2025-03-14 01:43:06,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:06,581 INFO L124 PetriNetUnfolderBase]: 76/1484 cut-off events. [2025-03-14 01:43:06,581 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-03-14 01:43:06,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1484 events. 76/1484 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7794 event pairs, 7 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1154. Up to 43 conditions per place. [2025-03-14 01:43:06,598 INFO L140 encePairwiseOnDemand]: 758/773 looper letters, 13 selfloop transitions, 8 changer transitions 13/699 dead transitions. [2025-03-14 01:43:06,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 699 transitions, 1505 flow [2025-03-14 01:43:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2025-03-14 01:43:06,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603277274687365 [2025-03-14 01:43:06,601 INFO L175 Difference]: Start difference. First operand has 679 places, 700 transitions, 1456 flow. Second operand 3 states and 2227 transitions. [2025-03-14 01:43:06,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 699 transitions, 1505 flow [2025-03-14 01:43:06,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 699 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:06,609 INFO L231 Difference]: Finished difference. Result has 674 places, 685 transitions, 1449 flow [2025-03-14 01:43:06,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=674, PETRI_TRANSITIONS=685} [2025-03-14 01:43:06,610 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -44 predicate places. [2025-03-14 01:43:06,610 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 685 transitions, 1449 flow [2025-03-14 01:43:06,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 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-14 01:43:06,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:06,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:43:06,611 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:06,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:06,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2049024499, now seen corresponding path program 1 times [2025-03-14 01:43:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995064668] [2025-03-14 01:43:06,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:06,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-14 01:43:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-14 01:43:06,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:06,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:06,639 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-14 01:43:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995064668] [2025-03-14 01:43:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995064668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966366340] [2025-03-14 01:43:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:06,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:06,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:06,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:06,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:06,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 685 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:43:06,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:06,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:06,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:06,826 INFO L124 PetriNetUnfolderBase]: 75/1468 cut-off events. [2025-03-14 01:43:06,826 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2025-03-14 01:43:06,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1468 events. 75/1468 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7618 event pairs, 10 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1419. Up to 67 conditions per place. [2025-03-14 01:43:06,848 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2025-03-14 01:43:06,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 685 transitions, 1490 flow [2025-03-14 01:43:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:43:06,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:43:06,852 INFO L175 Difference]: Start difference. First operand has 674 places, 685 transitions, 1449 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:43:06,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 685 transitions, 1490 flow [2025-03-14 01:43:06,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 685 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:06,860 INFO L231 Difference]: Finished difference. Result has 662 places, 684 transitions, 1445 flow [2025-03-14 01:43:06,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1445, PETRI_PLACES=662, PETRI_TRANSITIONS=684} [2025-03-14 01:43:06,861 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2025-03-14 01:43:06,861 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 684 transitions, 1445 flow [2025-03-14 01:43:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:43:06,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:06,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:43:06,862 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 233680178, now seen corresponding path program 1 times [2025-03-14 01:43:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056484353] [2025-03-14 01:43:06,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:06,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:43:06,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:43:06,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:06,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:06,895 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-14 01:43:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056484353] [2025-03-14 01:43:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056484353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:06,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:06,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:43:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844959558] [2025-03-14 01:43:06,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:06,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:06,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:06,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:06,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-03-14 01:43:06,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 684 transitions, 1445 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-14 01:43:06,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:06,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-03-14 01:43:06,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:07,424 INFO L124 PetriNetUnfolderBase]: 227/4868 cut-off events. [2025-03-14 01:43:07,425 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2025-03-14 01:43:07,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 4868 events. 227/4868 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41540 event pairs, 12 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 4505. Up to 99 conditions per place. [2025-03-14 01:43:07,504 INFO L140 encePairwiseOnDemand]: 765/773 looper letters, 17 selfloop transitions, 4 changer transitions 0/690 dead transitions. [2025-03-14 01:43:07,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 690 transitions, 1501 flow [2025-03-14 01:43:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:07,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2025-03-14 01:43:07,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9719706770159552 [2025-03-14 01:43:07,507 INFO L175 Difference]: Start difference. First operand has 662 places, 684 transitions, 1445 flow. Second operand 3 states and 2254 transitions. [2025-03-14 01:43:07,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 690 transitions, 1501 flow [2025-03-14 01:43:07,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 690 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:07,516 INFO L231 Difference]: Finished difference. Result has 664 places, 688 transitions, 1479 flow [2025-03-14 01:43:07,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=664, PETRI_TRANSITIONS=688} [2025-03-14 01:43:07,517 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2025-03-14 01:43:07,517 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 688 transitions, 1479 flow [2025-03-14 01:43:07,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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-14 01:43:07,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:07,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:07,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:43:07,518 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:07,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1079560017, now seen corresponding path program 1 times [2025-03-14 01:43:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:07,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65036520] [2025-03-14 01:43:07,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:07,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-14 01:43:07,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-14 01:43:07,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:07,557 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-14 01:43:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:07,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65036520] [2025-03-14 01:43:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65036520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:07,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:07,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330616114] [2025-03-14 01:43:07,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:07,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:07,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:07,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:07,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 773 [2025-03-14 01:43:07,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 688 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 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-14 01:43:07,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:07,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 773 [2025-03-14 01:43:07,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:08,390 INFO L124 PetriNetUnfolderBase]: 317/6361 cut-off events. [2025-03-14 01:43:08,390 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-14 01:43:08,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 6361 events. 317/6361 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56199 event pairs, 15 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 5735. Up to 138 conditions per place. [2025-03-14 01:43:08,457 INFO L140 encePairwiseOnDemand]: 756/773 looper letters, 20 selfloop transitions, 9 changer transitions 0/685 dead transitions. [2025-03-14 01:43:08,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 685 transitions, 1532 flow [2025-03-14 01:43:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2025-03-14 01:43:08,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551530832255283 [2025-03-14 01:43:08,460 INFO L175 Difference]: Start difference. First operand has 664 places, 688 transitions, 1479 flow. Second operand 3 states and 2215 transitions. [2025-03-14 01:43:08,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 685 transitions, 1532 flow [2025-03-14 01:43:08,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 685 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:08,467 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1511 flow [2025-03-14 01:43:08,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=659, PETRI_TRANSITIONS=684} [2025-03-14 01:43:08,468 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-03-14 01:43:08,468 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1511 flow [2025-03-14 01:43:08,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 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-14 01:43:08,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:08,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:43:08,469 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -603835350, now seen corresponding path program 1 times [2025-03-14 01:43:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861519885] [2025-03-14 01:43:08,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:08,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-14 01:43:08,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-14 01:43:08,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:08,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:08,497 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-14 01:43:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861519885] [2025-03-14 01:43:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861519885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189300520] [2025-03-14 01:43:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:08,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:08,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:08,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:08,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 684 transitions, 1511 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-14 01:43:08,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:08,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:08,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:09,217 INFO L124 PetriNetUnfolderBase]: 298/6252 cut-off events. [2025-03-14 01:43:09,217 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2025-03-14 01:43:09,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 6252 events. 298/6252 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 60230 event pairs, 32 based on Foata normal form. 0/5301 useless extension candidates. Maximal degree in co-relation 5677. Up to 122 conditions per place. [2025-03-14 01:43:09,279 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2025-03-14 01:43:09,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 684 transitions, 1560 flow [2025-03-14 01:43:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-03-14 01:43:09,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-03-14 01:43:09,282 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1511 flow. Second operand 3 states and 2235 transitions. [2025-03-14 01:43:09,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 684 transitions, 1560 flow [2025-03-14 01:43:09,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 684 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:09,289 INFO L231 Difference]: Finished difference. Result has 658 places, 683 transitions, 1497 flow [2025-03-14 01:43:09,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=658, PETRI_TRANSITIONS=683} [2025-03-14 01:43:09,290 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-03-14 01:43:09,290 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 683 transitions, 1497 flow [2025-03-14 01:43:09,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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-14 01:43:09,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:09,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:09,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:43:09,291 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:09,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:09,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1381384264, now seen corresponding path program 1 times [2025-03-14 01:43:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:09,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163686601] [2025-03-14 01:43:09,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:09,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:09,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-14 01:43:09,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-14 01:43:09,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:09,319 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-14 01:43:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:09,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163686601] [2025-03-14 01:43:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163686601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438688333] [2025-03-14 01:43:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:09,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:09,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:09,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 773 [2025-03-14 01:43:09,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 683 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 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-14 01:43:09,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:09,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 773 [2025-03-14 01:43:09,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:10,095 INFO L124 PetriNetUnfolderBase]: 318/5797 cut-off events. [2025-03-14 01:43:10,096 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2025-03-14 01:43:10,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 5797 events. 318/5797 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55965 event pairs, 16 based on Foata normal form. 0/4977 useless extension candidates. Maximal degree in co-relation 5688. Up to 262 conditions per place. [2025-03-14 01:43:10,167 INFO L140 encePairwiseOnDemand]: 756/773 looper letters, 20 selfloop transitions, 9 changer transitions 0/680 dead transitions. [2025-03-14 01:43:10,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 680 transitions, 1550 flow [2025-03-14 01:43:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2025-03-14 01:43:10,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551530832255283 [2025-03-14 01:43:10,169 INFO L175 Difference]: Start difference. First operand has 658 places, 683 transitions, 1497 flow. Second operand 3 states and 2215 transitions. [2025-03-14 01:43:10,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 680 transitions, 1550 flow [2025-03-14 01:43:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:10,175 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1527 flow [2025-03-14 01:43:10,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=652, PETRI_TRANSITIONS=679} [2025-03-14 01:43:10,176 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -66 predicate places. [2025-03-14 01:43:10,176 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1527 flow [2025-03-14 01:43:10,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 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-14 01:43:10,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:10,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 01:43:10,178 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:10,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1370452138, now seen corresponding path program 1 times [2025-03-14 01:43:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489161553] [2025-03-14 01:43:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:10,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:43:10,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:43:10,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:10,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:10,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-14 01:43:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489161553] [2025-03-14 01:43:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489161553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508945376] [2025-03-14 01:43:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:10,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:10,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:10,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:10,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 679 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-14 01:43:10,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:10,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:10,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:10,996 INFO L124 PetriNetUnfolderBase]: 300/5767 cut-off events. [2025-03-14 01:43:10,996 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2025-03-14 01:43:11,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 5767 events. 300/5767 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 55193 event pairs, 35 based on Foata normal form. 0/4963 useless extension candidates. Maximal degree in co-relation 5780. Up to 235 conditions per place. [2025-03-14 01:43:11,052 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2025-03-14 01:43:11,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 679 transitions, 1576 flow [2025-03-14 01:43:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-03-14 01:43:11,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-03-14 01:43:11,055 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1527 flow. Second operand 3 states and 2235 transitions. [2025-03-14 01:43:11,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 679 transitions, 1576 flow [2025-03-14 01:43:11,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 679 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:11,062 INFO L231 Difference]: Finished difference. Result has 651 places, 678 transitions, 1513 flow [2025-03-14 01:43:11,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=651, PETRI_TRANSITIONS=678} [2025-03-14 01:43:11,063 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -67 predicate places. [2025-03-14 01:43:11,063 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 678 transitions, 1513 flow [2025-03-14 01:43:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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-14 01:43:11,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:11,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:11,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 01:43:11,064 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1610199884, now seen corresponding path program 1 times [2025-03-14 01:43:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263071501] [2025-03-14 01:43:11,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:11,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-14 01:43:11,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-14 01:43:11,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:11,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:11,091 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-14 01:43:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263071501] [2025-03-14 01:43:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263071501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:11,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:11,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039528367] [2025-03-14 01:43:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:11,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:11,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:11,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:11,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:11,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:11,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 678 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-14 01:43:11,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:11,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:11,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:11,898 INFO L124 PetriNetUnfolderBase]: 263/5685 cut-off events. [2025-03-14 01:43:11,898 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:43:12,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 5685 events. 263/5685 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54369 event pairs, 9 based on Foata normal form. 0/4946 useless extension candidates. Maximal degree in co-relation 5448. Up to 106 conditions per place. [2025-03-14 01:43:12,027 INFO L140 encePairwiseOnDemand]: 766/773 looper letters, 12 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2025-03-14 01:43:12,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 675 transitions, 1538 flow [2025-03-14 01:43:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2025-03-14 01:43:12,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655023717119448 [2025-03-14 01:43:12,030 INFO L175 Difference]: Start difference. First operand has 651 places, 678 transitions, 1513 flow. Second operand 3 states and 2239 transitions. [2025-03-14 01:43:12,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 675 transitions, 1538 flow [2025-03-14 01:43:12,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 675 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:12,038 INFO L231 Difference]: Finished difference. Result has 647 places, 674 transitions, 1505 flow [2025-03-14 01:43:12,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=647, PETRI_TRANSITIONS=674} [2025-03-14 01:43:12,039 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -71 predicate places. [2025-03-14 01:43:12,039 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 674 transitions, 1505 flow [2025-03-14 01:43:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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-14 01:43:12,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:12,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:43:12,040 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:12,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1614815424, now seen corresponding path program 1 times [2025-03-14 01:43:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505994106] [2025-03-14 01:43:12,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:12,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-14 01:43:12,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-14 01:43:12,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:12,092 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-14 01:43:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505994106] [2025-03-14 01:43:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505994106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:12,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:12,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394223177] [2025-03-14 01:43:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:12,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:12,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:12,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:12,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 674 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:43:12,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:12,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:12,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:13,025 INFO L124 PetriNetUnfolderBase]: 291/5673 cut-off events. [2025-03-14 01:43:13,026 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2025-03-14 01:43:13,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 5673 events. 291/5673 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 53568 event pairs, 12 based on Foata normal form. 0/4965 useless extension candidates. Maximal degree in co-relation 5570. Up to 162 conditions per place. [2025-03-14 01:43:13,117 INFO L140 encePairwiseOnDemand]: 766/773 looper letters, 12 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2025-03-14 01:43:13,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 671 transitions, 1530 flow [2025-03-14 01:43:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2025-03-14 01:43:13,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9655023717119448 [2025-03-14 01:43:13,119 INFO L175 Difference]: Start difference. First operand has 647 places, 674 transitions, 1505 flow. Second operand 3 states and 2239 transitions. [2025-03-14 01:43:13,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 671 transitions, 1530 flow [2025-03-14 01:43:13,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 671 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:13,126 INFO L231 Difference]: Finished difference. Result has 643 places, 670 transitions, 1497 flow [2025-03-14 01:43:13,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=643, PETRI_TRANSITIONS=670} [2025-03-14 01:43:13,127 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2025-03-14 01:43:13,127 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 670 transitions, 1497 flow [2025-03-14 01:43:13,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:43:13,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:13,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:13,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 01:43:13,128 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -947802288, now seen corresponding path program 1 times [2025-03-14 01:43:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475507573] [2025-03-14 01:43:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:13,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-14 01:43:13,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-14 01:43:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:13,157 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-14 01:43:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475507573] [2025-03-14 01:43:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475507573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:13,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753661785] [2025-03-14 01:43:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:13,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:13,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:13,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:13,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:13,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-03-14 01:43:13,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 670 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-14 01:43:13,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:13,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-03-14 01:43:13,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:14,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,249 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 132#L76-14true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,249 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:43:14,249 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:43:14,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,251 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-14 01:43:14,251 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:43:14,251 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,251 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-14true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,260 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-03-14 01:43:14,260 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-14 01:43:14,260 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:43:14,260 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 132#L76-14true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,274 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,274 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,274 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,275 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 831#(= |#race~break_10~0| 0), 132#L76-14true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,275 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,275 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,276 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:14,276 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:14,276 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,276 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,277 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:14,277 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,277 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:14,277 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-14true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,282 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-14 01:43:14,282 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,282 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,282 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-14true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,284 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-14 01:43:14,284 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:14,284 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,284 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, 132#L76-14true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,296 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,296 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:43:14,296 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:14,297 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:14,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,298 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-03-14 01:43:14,298 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:14,298 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:14,298 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:43:14,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 50#L55-14true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,310 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2025-03-14 01:43:14,310 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:43:14,310 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:14,310 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2025-03-14 01:43:14,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2105] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 438#L110true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,361 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-14 01:43:14,361 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-14 01:43:14,361 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-14 01:43:14,362 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-14 01:43:14,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2105] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 831#(= |#race~break_10~0| 0), 132#L76-14true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 438#L110true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,362 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-03-14 01:43:14,362 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-14 01:43:14,362 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:43:14,362 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:43:14,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 438#L110true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,374 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2025-03-14 01:43:14,374 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2025-03-14 01:43:14,374 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-14 01:43:14,374 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2105] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 829#true, 132#L76-14true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 438#L110true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,381 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2105] thread1EXIT-->L110: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][518], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 438#L110true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,381 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:43:14,381 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-14 01:43:14,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 438#L110true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:14,388 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2025-03-14 01:43:14,388 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2025-03-14 01:43:14,388 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-03-14 01:43:14,388 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-03-14 01:43:14,439 INFO L124 PetriNetUnfolderBase]: 565/10661 cut-off events. [2025-03-14 01:43:14,440 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2025-03-14 01:43:14,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 10661 events. 565/10661 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 107489 event pairs, 22 based on Foata normal form. 0/9336 useless extension candidates. Maximal degree in co-relation 10879. Up to 298 conditions per place. [2025-03-14 01:43:14,601 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 2 changer transitions 0/672 dead transitions. [2025-03-14 01:43:14,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 672 transitions, 1527 flow [2025-03-14 01:43:14,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-03-14 01:43:14,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-03-14 01:43:14,603 INFO L175 Difference]: Start difference. First operand has 643 places, 670 transitions, 1497 flow. Second operand 3 states and 2258 transitions. [2025-03-14 01:43:14,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 672 transitions, 1527 flow [2025-03-14 01:43:14,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 672 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:14,610 INFO L231 Difference]: Finished difference. Result has 642 places, 670 transitions, 1501 flow [2025-03-14 01:43:14,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=642, PETRI_TRANSITIONS=670} [2025-03-14 01:43:14,611 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -76 predicate places. [2025-03-14 01:43:14,611 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 670 transitions, 1501 flow [2025-03-14 01:43:14,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-14 01:43:14,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:14,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:14,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 01:43:14,612 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 179044502, now seen corresponding path program 1 times [2025-03-14 01:43:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-03-14 01:43:14,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-14 01:43:14,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-14 01:43:14,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:14,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:14,647 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-14 01:43:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-03-14 01:43:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148206422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903792960] [2025-03-14 01:43:14,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:14,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:14,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:14,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:14,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 670 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-14 01:43:14,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:14,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:14,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:15,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:15,770 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:15,770 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:15,770 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:15,823 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1649] L55-15-->L55-13: Formula: (= |v_#race~nondet_0~0_3| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_3|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:15,823 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:15,823 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:16,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:16,350 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-14 01:43:16,350 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-14 01:43:16,350 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:16,350 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-14 01:43:16,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:16,378 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:16,378 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:16,378 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:16,378 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:16,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:16,379 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:16,379 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:16,379 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:16,379 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:16,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:16,408 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-03-14 01:43:16,408 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:16,408 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:43:16,408 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:16,552 INFO L124 PetriNetUnfolderBase]: 706/15546 cut-off events. [2025-03-14 01:43:16,553 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-14 01:43:16,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17503 conditions, 15546 events. 706/15546 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 173722 event pairs, 63 based on Foata normal form. 0/13771 useless extension candidates. Maximal degree in co-relation 16427. Up to 356 conditions per place. [2025-03-14 01:43:16,710 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2025-03-14 01:43:16,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 670 transitions, 1542 flow [2025-03-14 01:43:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:43:16,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:43:16,712 INFO L175 Difference]: Start difference. First operand has 642 places, 670 transitions, 1501 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:43:16,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 670 transitions, 1542 flow [2025-03-14 01:43:16,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 670 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:16,720 INFO L231 Difference]: Finished difference. Result has 643 places, 669 transitions, 1505 flow [2025-03-14 01:43:16,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=643, PETRI_TRANSITIONS=669} [2025-03-14 01:43:16,721 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2025-03-14 01:43:16,721 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 669 transitions, 1505 flow [2025-03-14 01:43:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-14 01:43:16,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:16,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:16,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 01:43:16,722 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:16,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1148818947, now seen corresponding path program 1 times [2025-03-14 01:43:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-14 01:43:16,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:16,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-14 01:43:16,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-14 01:43:16,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:16,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:16,806 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-14 01:43:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-14 01:43:16,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:16,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:16,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:43:16,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902886044] [2025-03-14 01:43:16,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:16,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:43:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:16,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:43:16,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:43:16,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-03-14 01:43:16,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 669 transitions, 1505 flow. Second operand has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 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-14 01:43:16,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:16,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-03-14 01:43:16,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:17,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:17,893 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-14 01:43:17,893 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:17,893 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-14 01:43:17,893 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2025-03-14 01:43:17,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:17,912 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2025-03-14 01:43:17,912 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:17,912 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-14 01:43:17,912 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2025-03-14 01:43:18,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:18,152 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2025-03-14 01:43:18,152 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2025-03-14 01:43:18,152 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2025-03-14 01:43:18,152 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-14 01:43:18,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:18,159 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2025-03-14 01:43:18,159 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2025-03-14 01:43:18,159 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-14 01:43:18,159 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-14 01:43:18,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:18,160 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2025-03-14 01:43:18,160 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-14 01:43:18,160 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-14 01:43:18,160 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2025-03-14 01:43:18,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:18,167 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2025-03-14 01:43:18,167 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2025-03-14 01:43:18,167 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-14 01:43:18,167 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-14 01:43:18,207 INFO L124 PetriNetUnfolderBase]: 463/10013 cut-off events. [2025-03-14 01:43:18,208 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-14 01:43:18,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 10013 events. 463/10013 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 92192 event pairs, 26 based on Foata normal form. 0/8837 useless extension candidates. Maximal degree in co-relation 11011. Up to 159 conditions per place. [2025-03-14 01:43:18,371 INFO L140 encePairwiseOnDemand]: 765/773 looper letters, 13 selfloop transitions, 8 changer transitions 0/678 dead transitions. [2025-03-14 01:43:18,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 678 transitions, 1569 flow [2025-03-14 01:43:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:43:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:43:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3752 transitions. [2025-03-14 01:43:18,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707632600258732 [2025-03-14 01:43:18,373 INFO L175 Difference]: Start difference. First operand has 643 places, 669 transitions, 1505 flow. Second operand 5 states and 3752 transitions. [2025-03-14 01:43:18,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 678 transitions, 1569 flow [2025-03-14 01:43:18,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 678 transitions, 1563 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:18,381 INFO L231 Difference]: Finished difference. Result has 648 places, 673 transitions, 1545 flow [2025-03-14 01:43:18,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1545, PETRI_PLACES=648, PETRI_TRANSITIONS=673} [2025-03-14 01:43:18,382 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -70 predicate places. [2025-03-14 01:43:18,382 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 673 transitions, 1545 flow [2025-03-14 01:43:18,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 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-14 01:43:18,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:18,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 01:43:18,383 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1543857298, now seen corresponding path program 1 times [2025-03-14 01:43:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160353192] [2025-03-14 01:43:18,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:18,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-14 01:43:18,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-14 01:43:18,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:18,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:18,461 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-14 01:43:18,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:18,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160353192] [2025-03-14 01:43:18,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160353192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:18,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:18,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:43:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792030733] [2025-03-14 01:43:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:18,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:43:18,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:18,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:43:18,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:43:18,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-03-14 01:43:18,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 673 transitions, 1545 flow. Second operand has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 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-14 01:43:18,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:18,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-03-14 01:43:18,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:19,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 850#true, 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:19,443 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2025-03-14 01:43:19,443 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:43:19,443 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-14 01:43:19,443 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-14 01:43:19,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 850#true, 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:19,463 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2025-03-14 01:43:19,463 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:43:19,463 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-14 01:43:19,463 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-14 01:43:19,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:19,707 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2025-03-14 01:43:19,707 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2025-03-14 01:43:19,708 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-14 01:43:19,708 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2025-03-14 01:43:19,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:19,714 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2025-03-14 01:43:19,714 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-14 01:43:19,714 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-14 01:43:19,714 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-14 01:43:19,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:19,716 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2025-03-14 01:43:19,716 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2025-03-14 01:43:19,716 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-14 01:43:19,716 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-14 01:43:19,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:19,723 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2025-03-14 01:43:19,723 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-14 01:43:19,723 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2025-03-14 01:43:19,723 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-14 01:43:19,767 INFO L124 PetriNetUnfolderBase]: 399/8981 cut-off events. [2025-03-14 01:43:19,768 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2025-03-14 01:43:19,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10021 conditions, 8981 events. 399/8981 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 79875 event pairs, 14 based on Foata normal form. 1/7930 useless extension candidates. Maximal degree in co-relation 9793. Up to 159 conditions per place. [2025-03-14 01:43:19,949 INFO L140 encePairwiseOnDemand]: 766/773 looper letters, 7 selfloop transitions, 6 changer transitions 0/674 dead transitions. [2025-03-14 01:43:19,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 674 transitions, 1573 flow [2025-03-14 01:43:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:43:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:43:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3744 transitions. [2025-03-14 01:43:19,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686934023285899 [2025-03-14 01:43:19,952 INFO L175 Difference]: Start difference. First operand has 648 places, 673 transitions, 1545 flow. Second operand 5 states and 3744 transitions. [2025-03-14 01:43:19,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 674 transitions, 1573 flow [2025-03-14 01:43:19,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 674 transitions, 1573 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:19,961 INFO L231 Difference]: Finished difference. Result has 653 places, 674 transitions, 1565 flow [2025-03-14 01:43:19,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1565, PETRI_PLACES=653, PETRI_TRANSITIONS=674} [2025-03-14 01:43:19,962 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -65 predicate places. [2025-03-14 01:43:19,962 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 674 transitions, 1565 flow [2025-03-14 01:43:19,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 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-14 01:43:19,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:19,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:43:19,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 01:43:19,963 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:19,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:19,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2016534430, now seen corresponding path program 1 times [2025-03-14 01:43:19,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:19,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-14 01:43:19,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:19,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:19,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-14 01:43:19,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-14 01:43:19,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:19,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-14 01:43:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645539102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:43:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325488260] [2025-03-14 01:43:20,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:20,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:43:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:43:20,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:43:20,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:43:20,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-14 01:43:20,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-14 01:43:20,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:20,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:20,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:43:20,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:43:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:20,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:43:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:43:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325488260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:43:20,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:43:20,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-14 01:43:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228755373] [2025-03-14 01:43:20,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:43:20,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:43:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:20,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:43:20,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:43:20,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 773 [2025-03-14 01:43:20,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 674 transitions, 1565 flow. Second operand has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 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-14 01:43:20,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:20,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 773 [2025-03-14 01:43:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:21,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 850#true, Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:21,784 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-03-14 01:43:21,784 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:43:21,784 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:43:21,784 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-14 01:43:21,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 850#true, Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:21,802 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2025-03-14 01:43:21,802 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:43:21,802 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:43:21,802 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2025-03-14 01:43:22,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:22,162 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2025-03-14 01:43:22,162 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2025-03-14 01:43:22,162 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-14 01:43:22,162 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-14 01:43:22,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:22,189 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-03-14 01:43:22,189 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:22,190 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-03-14 01:43:22,190 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:22,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:22,191 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-03-14 01:43:22,191 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-03-14 01:43:22,191 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:22,191 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:22,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), Black: 791#true, 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:22,202 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2025-03-14 01:43:22,202 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2025-03-14 01:43:22,202 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-03-14 01:43:22,202 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-03-14 01:43:22,274 INFO L124 PetriNetUnfolderBase]: 399/8998 cut-off events. [2025-03-14 01:43:22,275 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2025-03-14 01:43:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 8998 events. 399/8998 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 79978 event pairs, 14 based on Foata normal form. 2/7948 useless extension candidates. Maximal degree in co-relation 9847. Up to 159 conditions per place. [2025-03-14 01:43:22,376 INFO L140 encePairwiseOnDemand]: 763/773 looper letters, 11 selfloop transitions, 13 changer transitions 0/682 dead transitions. [2025-03-14 01:43:22,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 682 transitions, 1631 flow [2025-03-14 01:43:22,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:43:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:43:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8199 transitions. [2025-03-14 01:43:22,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96424791250147 [2025-03-14 01:43:22,380 INFO L175 Difference]: Start difference. First operand has 653 places, 674 transitions, 1565 flow. Second operand 11 states and 8199 transitions. [2025-03-14 01:43:22,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 682 transitions, 1631 flow [2025-03-14 01:43:22,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1621 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:43:22,388 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1615 flow [2025-03-14 01:43:22,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1615, PETRI_PLACES=663, PETRI_TRANSITIONS=680} [2025-03-14 01:43:22,389 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -55 predicate places. [2025-03-14 01:43:22,389 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1615 flow [2025-03-14 01:43:22,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 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-14 01:43:22,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:22,390 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:22,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:43:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-14 01:43:22,591 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash -21170462, now seen corresponding path program 2 times [2025-03-14 01:43:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663298776] [2025-03-14 01:43:22,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:43:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:22,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 246 statements into 2 equivalence classes. [2025-03-14 01:43:22,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 201 of 246 statements. [2025-03-14 01:43:22,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:43:22,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663298776] [2025-03-14 01:43:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663298776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:43:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612380427] [2025-03-14 01:43:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:22,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:43:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:22,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:43:22,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:43:23,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 773 [2025-03-14 01:43:23,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 680 transitions, 1615 flow. Second operand has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 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-14 01:43:23,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:23,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 773 [2025-03-14 01:43:23,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:24,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 666#L108-1true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 850#true, Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:24,442 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-03-14 01:43:24,442 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-14 01:43:24,442 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:43:24,442 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:43:24,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 666#L108-1true, Black: 816#true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 850#true, Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:24,472 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2025-03-14 01:43:24,472 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2025-03-14 01:43:24,472 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:43:24,472 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:43:24,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:24,836 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2025-03-14 01:43:24,836 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-14 01:43:24,836 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2025-03-14 01:43:24,836 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-14 01:43:24,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:24,845 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-03-14 01:43:24,845 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:24,845 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:24,845 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-03-14 01:43:24,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 666#L108-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:24,846 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2025-03-14 01:43:24,846 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:24,846 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-03-14 01:43:24,846 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2025-03-14 01:43:24,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1926] L76-15-->L76-13: Formula: (= |v_#race~nondet_0~0_6| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_6|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 666#L108-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork1_#t~short8#1|), 716#L76-13true, 176#L55-13true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2025-03-14 01:43:24,856 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2025-03-14 01:43:24,856 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2025-03-14 01:43:24,856 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-03-14 01:43:24,856 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2025-03-14 01:43:24,914 INFO L124 PetriNetUnfolderBase]: 473/10030 cut-off events. [2025-03-14 01:43:24,914 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-14 01:43:25,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 10030 events. 473/10030 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 92141 event pairs, 17 based on Foata normal form. 0/8886 useless extension candidates. Maximal degree in co-relation 11213. Up to 159 conditions per place. [2025-03-14 01:43:25,060 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 17 selfloop transitions, 6 changer transitions 0/683 dead transitions. [2025-03-14 01:43:25,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1671 flow [2025-03-14 01:43:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:43:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:43:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2025-03-14 01:43:25,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609745579991376 [2025-03-14 01:43:25,062 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1615 flow. Second operand 6 states and 4457 transitions. [2025-03-14 01:43:25,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1671 flow [2025-03-14 01:43:25,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 683 transitions, 1659 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 01:43:25,072 INFO L231 Difference]: Finished difference. Result has 664 places, 679 transitions, 1613 flow [2025-03-14 01:43:25,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=664, PETRI_TRANSITIONS=679} [2025-03-14 01:43:25,073 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2025-03-14 01:43:25,073 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 679 transitions, 1613 flow [2025-03-14 01:43:25,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 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-14 01:43:25,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:25,074 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:25,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 01:43:25,074 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:25,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:25,075 INFO L85 PathProgramCache]: Analyzing trace with hash 868853330, now seen corresponding path program 1 times [2025-03-14 01:43:25,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:25,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153169656] [2025-03-14 01:43:25,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:25,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:25,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-14 01:43:25,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-14 01:43:25,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153169656] [2025-03-14 01:43:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153169656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:25,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:25,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:43:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145481264] [2025-03-14 01:43:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:43:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:25,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:43:25,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:43:25,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 773 [2025-03-14 01:43:25,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 679 transitions, 1613 flow. Second operand has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 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-14 01:43:25,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:25,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 773 [2025-03-14 01:43:25,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:27,291 INFO L124 PetriNetUnfolderBase]: 649/12848 cut-off events. [2025-03-14 01:43:27,291 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2025-03-14 01:43:27,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 12848 events. 649/12848 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 126765 event pairs, 42 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 14420. Up to 283 conditions per place. [2025-03-14 01:43:27,484 INFO L140 encePairwiseOnDemand]: 765/773 looper letters, 12 selfloop transitions, 8 changer transitions 0/687 dead transitions. [2025-03-14 01:43:27,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 687 transitions, 1672 flow [2025-03-14 01:43:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:43:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:43:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3751 transitions. [2025-03-14 01:43:27,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705045278137128 [2025-03-14 01:43:27,490 INFO L175 Difference]: Start difference. First operand has 664 places, 679 transitions, 1613 flow. Second operand 5 states and 3751 transitions. [2025-03-14 01:43:27,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 687 transitions, 1672 flow [2025-03-14 01:43:27,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1660 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:43:27,507 INFO L231 Difference]: Finished difference. Result has 666 places, 683 transitions, 1647 flow [2025-03-14 01:43:27,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=683} [2025-03-14 01:43:27,508 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2025-03-14 01:43:27,508 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 683 transitions, 1647 flow [2025-03-14 01:43:27,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 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-14 01:43:27,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:27,510 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:27,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 01:43:27,510 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:27,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2098250517, now seen corresponding path program 1 times [2025-03-14 01:43:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292122399] [2025-03-14 01:43:27,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:27,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-14 01:43:27,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-14 01:43:27,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:27,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292122399] [2025-03-14 01:43:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292122399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:27,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:27,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:27,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688500646] [2025-03-14 01:43:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:27,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:27,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:27,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:27,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:27,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 683 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-14 01:43:27,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:27,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:27,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:29,778 INFO L124 PetriNetUnfolderBase]: 731/12842 cut-off events. [2025-03-14 01:43:29,778 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2025-03-14 01:43:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 12842 events. 731/12842 cut-off events. For 633/637 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 129704 event pairs, 103 based on Foata normal form. 0/11329 useless extension candidates. Maximal degree in co-relation 14980. Up to 611 conditions per place. [2025-03-14 01:43:29,963 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 16 selfloop transitions, 3 changer transitions 1/683 dead transitions. [2025-03-14 01:43:29,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1688 flow [2025-03-14 01:43:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:43:29,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:43:29,965 INFO L175 Difference]: Start difference. First operand has 666 places, 683 transitions, 1647 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:43:29,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1688 flow [2025-03-14 01:43:29,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:43:29,973 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1651 flow [2025-03-14 01:43:29,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=667, PETRI_TRANSITIONS=682} [2025-03-14 01:43:29,974 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -51 predicate places. [2025-03-14 01:43:29,975 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1651 flow [2025-03-14 01:43:29,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-14 01:43:29,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:29,975 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:29,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 01:43:29,975 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -624123928, now seen corresponding path program 1 times [2025-03-14 01:43:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709442084] [2025-03-14 01:43:29,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:29,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-14 01:43:29,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-14 01:43:29,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:29,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709442084] [2025-03-14 01:43:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709442084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:30,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446330740] [2025-03-14 01:43:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:30,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:30,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:30,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:30,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 773 [2025-03-14 01:43:30,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 682 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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-14 01:43:30,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:30,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 773 [2025-03-14 01:43:30,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:31,887 INFO L124 PetriNetUnfolderBase]: 567/11726 cut-off events. [2025-03-14 01:43:31,887 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2025-03-14 01:43:32,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13549 conditions, 11726 events. 567/11726 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 110227 event pairs, 52 based on Foata normal form. 0/10408 useless extension candidates. Maximal degree in co-relation 13327. Up to 253 conditions per place. [2025-03-14 01:43:32,074 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 11 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2025-03-14 01:43:32,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 682 transitions, 1678 flow [2025-03-14 01:43:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2025-03-14 01:43:32,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698145752479517 [2025-03-14 01:43:32,076 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1651 flow. Second operand 3 states and 2249 transitions. [2025-03-14 01:43:32,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 682 transitions, 1678 flow [2025-03-14 01:43:32,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 682 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:32,087 INFO L231 Difference]: Finished difference. Result has 666 places, 681 transitions, 1647 flow [2025-03-14 01:43:32,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=681} [2025-03-14 01:43:32,088 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2025-03-14 01:43:32,088 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 681 transitions, 1647 flow [2025-03-14 01:43:32,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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-14 01:43:32,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:32,088 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:32,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 01:43:32,089 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:32,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1136085650, now seen corresponding path program 1 times [2025-03-14 01:43:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:32,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396948329] [2025-03-14 01:43:32,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:32,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-14 01:43:32,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-14 01:43:32,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:32,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396948329] [2025-03-14 01:43:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396948329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:43:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135714428] [2025-03-14 01:43:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:43:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:32,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:43:32,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:43:32,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 773 [2025-03-14 01:43:32,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 681 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 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-14 01:43:32,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:32,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 773 [2025-03-14 01:43:32,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:35,351 INFO L124 PetriNetUnfolderBase]: 670/12757 cut-off events. [2025-03-14 01:43:35,351 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2025-03-14 01:43:35,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14903 conditions, 12757 events. 670/12757 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 127467 event pairs, 30 based on Foata normal form. 0/11365 useless extension candidates. Maximal degree in co-relation 14667. Up to 283 conditions per place. [2025-03-14 01:43:35,485 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2025-03-14 01:43:35,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 684 transitions, 1703 flow [2025-03-14 01:43:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:43:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:43:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2025-03-14 01:43:35,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609745579991376 [2025-03-14 01:43:35,487 INFO L175 Difference]: Start difference. First operand has 666 places, 681 transitions, 1647 flow. Second operand 6 states and 4457 transitions. [2025-03-14 01:43:35,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 684 transitions, 1703 flow [2025-03-14 01:43:35,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:35,496 INFO L231 Difference]: Finished difference. Result has 668 places, 680 transitions, 1653 flow [2025-03-14 01:43:35,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=668, PETRI_TRANSITIONS=680} [2025-03-14 01:43:35,497 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -50 predicate places. [2025-03-14 01:43:35,497 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 680 transitions, 1653 flow [2025-03-14 01:43:35,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 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-14 01:43:35,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:35,498 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:35,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-14 01:43:35,498 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:35,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:35,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1698327852, now seen corresponding path program 1 times [2025-03-14 01:43:35,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:35,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-14 01:43:35,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:35,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-14 01:43:35,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-14 01:43:35,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:35,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-14 01:43:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:35,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:35,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312212391] [2025-03-14 01:43:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:35,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:35,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:35,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:35,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 773 [2025-03-14 01:43:35,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 680 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-14 01:43:35,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:35,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 773 [2025-03-14 01:43:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:38,465 INFO L124 PetriNetUnfolderBase]: 653/13672 cut-off events. [2025-03-14 01:43:38,466 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-03-14 01:43:38,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15987 conditions, 13672 events. 653/13672 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 130717 event pairs, 26 based on Foata normal form. 0/12248 useless extension candidates. Maximal degree in co-relation 15765. Up to 313 conditions per place. [2025-03-14 01:43:38,636 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 14 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2025-03-14 01:43:38,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 679 transitions, 1685 flow [2025-03-14 01:43:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2025-03-14 01:43:38,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672272531263476 [2025-03-14 01:43:38,639 INFO L175 Difference]: Start difference. First operand has 668 places, 680 transitions, 1653 flow. Second operand 3 states and 2243 transitions. [2025-03-14 01:43:38,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 679 transitions, 1685 flow [2025-03-14 01:43:38,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1673 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:43:38,650 INFO L231 Difference]: Finished difference. Result has 662 places, 677 transitions, 1643 flow [2025-03-14 01:43:38,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=677} [2025-03-14 01:43:38,652 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2025-03-14 01:43:38,652 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 677 transitions, 1643 flow [2025-03-14 01:43:38,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-14 01:43:38,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:38,652 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-14 01:43:38,652 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1484805556, now seen corresponding path program 1 times [2025-03-14 01:43:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398811763] [2025-03-14 01:43:38,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:38,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-14 01:43:38,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-14 01:43:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398811763] [2025-03-14 01:43:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398811763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944446822] [2025-03-14 01:43:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:38,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:38,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:38,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 773 [2025-03-14 01:43:38,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 677 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-14 01:43:38,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:38,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 773 [2025-03-14 01:43:38,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:40,976 INFO L124 PetriNetUnfolderBase]: 687/12102 cut-off events. [2025-03-14 01:43:40,976 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2025-03-14 01:43:41,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14276 conditions, 12102 events. 687/12102 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 120460 event pairs, 82 based on Foata normal form. 0/10846 useless extension candidates. Maximal degree in co-relation 14053. Up to 434 conditions per place. [2025-03-14 01:43:41,131 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 11 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2025-03-14 01:43:41,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 677 transitions, 1670 flow [2025-03-14 01:43:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2025-03-14 01:43:41,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9698145752479517 [2025-03-14 01:43:41,132 INFO L175 Difference]: Start difference. First operand has 662 places, 677 transitions, 1643 flow. Second operand 3 states and 2249 transitions. [2025-03-14 01:43:41,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 677 transitions, 1670 flow [2025-03-14 01:43:41,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 677 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:41,141 INFO L231 Difference]: Finished difference. Result has 662 places, 676 transitions, 1643 flow [2025-03-14 01:43:41,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=676} [2025-03-14 01:43:41,142 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2025-03-14 01:43:41,142 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 676 transitions, 1643 flow [2025-03-14 01:43:41,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-14 01:43:41,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:41,142 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:41,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-14 01:43:41,143 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:41,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -741836232, now seen corresponding path program 1 times [2025-03-14 01:43:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690098462] [2025-03-14 01:43:41,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:41,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-14 01:43:41,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-14 01:43:41,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:41,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:41,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690098462] [2025-03-14 01:43:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690098462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007299962] [2025-03-14 01:43:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:41,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:41,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:41,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:41,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:41,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 773 [2025-03-14 01:43:41,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 676 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-14 01:43:41,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:41,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 773 [2025-03-14 01:43:41,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:43,355 INFO L124 PetriNetUnfolderBase]: 693/11895 cut-off events. [2025-03-14 01:43:43,356 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2025-03-14 01:43:43,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 11895 events. 693/11895 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 118717 event pairs, 30 based on Foata normal form. 0/10840 useless extension candidates. Maximal degree in co-relation 13979. Up to 520 conditions per place. [2025-03-14 01:43:43,484 INFO L140 encePairwiseOnDemand]: 767/773 looper letters, 13 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2025-03-14 01:43:43,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1672 flow [2025-03-14 01:43:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:43,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2025-03-14 01:43:43,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9667960327727468 [2025-03-14 01:43:43,486 INFO L175 Difference]: Start difference. First operand has 662 places, 676 transitions, 1643 flow. Second operand 3 states and 2242 transitions. [2025-03-14 01:43:43,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1672 flow [2025-03-14 01:43:43,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:43,498 INFO L231 Difference]: Finished difference. Result has 659 places, 673 transitions, 1641 flow [2025-03-14 01:43:43,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=659, PETRI_TRANSITIONS=673} [2025-03-14 01:43:43,499 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-03-14 01:43:43,499 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 673 transitions, 1641 flow [2025-03-14 01:43:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-14 01:43:43,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:43,500 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:43,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-14 01:43:43,500 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:43,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 123395192, now seen corresponding path program 1 times [2025-03-14 01:43:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870473465] [2025-03-14 01:43:43,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:43,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-14 01:43:43,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-14 01:43:43,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:43,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:43,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:43,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870473465] [2025-03-14 01:43:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870473465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:43,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45746308] [2025-03-14 01:43:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:43,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:43,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:43,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:43,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:43,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 673 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:43:43,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:43,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:43,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:46,373 INFO L124 PetriNetUnfolderBase]: 825/17128 cut-off events. [2025-03-14 01:43:46,373 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-03-14 01:43:46,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 17128 events. 825/17128 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 177849 event pairs, 75 based on Foata normal form. 0/15687 useless extension candidates. Maximal degree in co-relation 19793. Up to 418 conditions per place. [2025-03-14 01:43:46,540 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2025-03-14 01:43:46,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 673 transitions, 1682 flow [2025-03-14 01:43:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:43:46,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:43:46,542 INFO L175 Difference]: Start difference. First operand has 659 places, 673 transitions, 1641 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:43:46,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 673 transitions, 1682 flow [2025-03-14 01:43:46,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:43:46,552 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2025-03-14 01:43:46,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-03-14 01:43:46,552 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-03-14 01:43:46,553 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2025-03-14 01:43:46,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:43:46,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:46,553 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:46,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-14 01:43:46,553 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 16037892, now seen corresponding path program 1 times [2025-03-14 01:43:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48197261] [2025-03-14 01:43:46,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:46,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-14 01:43:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-14 01:43:46,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:46,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48197261] [2025-03-14 01:43:46,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48197261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:46,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:46,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:46,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804582156] [2025-03-14 01:43:46,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:46,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:46,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:46,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:46,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:46,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:46,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-14 01:43:46,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:46,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:46,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:48,980 INFO L124 PetriNetUnfolderBase]: 747/12382 cut-off events. [2025-03-14 01:43:48,980 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2025-03-14 01:43:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15075 conditions, 12382 events. 747/12382 cut-off events. For 634/638 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 124388 event pairs, 110 based on Foata normal form. 0/11349 useless extension candidates. Maximal degree in co-relation 14851. Up to 645 conditions per place. [2025-03-14 01:43:49,122 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-03-14 01:43:49,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1684 flow [2025-03-14 01:43:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:43:49,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:43:49,124 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1643 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:43:49,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1684 flow [2025-03-14 01:43:49,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:49,135 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1641 flow [2025-03-14 01:43:49,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-03-14 01:43:49,136 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-03-14 01:43:49,136 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1641 flow [2025-03-14 01:43:49,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-14 01:43:49,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:49,136 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-14 01:43:49,136 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1107690978, now seen corresponding path program 1 times [2025-03-14 01:43:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779146364] [2025-03-14 01:43:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:49,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-14 01:43:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-14 01:43:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779146364] [2025-03-14 01:43:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779146364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:49,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087298625] [2025-03-14 01:43:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:49,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:49,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:49,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:49,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:49,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 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-14 01:43:49,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:49,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:49,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:53,135 INFO L124 PetriNetUnfolderBase]: 871/18314 cut-off events. [2025-03-14 01:43:53,135 INFO L125 PetriNetUnfolderBase]: For 466/468 co-relation queries the response was YES. [2025-03-14 01:43:53,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21607 conditions, 18314 events. 871/18314 cut-off events. For 466/468 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 191453 event pairs, 66 based on Foata normal form. 0/16865 useless extension candidates. Maximal degree in co-relation 21383. Up to 451 conditions per place. [2025-03-14 01:43:53,290 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2025-03-14 01:43:53,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1690 flow [2025-03-14 01:43:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-03-14 01:43:53,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-03-14 01:43:53,291 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1641 flow. Second operand 3 states and 2235 transitions. [2025-03-14 01:43:53,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1690 flow [2025-03-14 01:43:53,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:53,305 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1639 flow [2025-03-14 01:43:53,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2025-03-14 01:43:53,310 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2025-03-14 01:43:53,310 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1639 flow [2025-03-14 01:43:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 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-14 01:43:53,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:53,310 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:53,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-14 01:43:53,310 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:53,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -524589266, now seen corresponding path program 1 times [2025-03-14 01:43:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:53,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853603090] [2025-03-14 01:43:53,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-14 01:43:53,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-14 01:43:53,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:53,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:53,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853603090] [2025-03-14 01:43:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853603090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224914485] [2025-03-14 01:43:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:53,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:53,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:53,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:43:53,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-14 01:43:53,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:53,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:43:53,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:55,698 INFO L124 PetriNetUnfolderBase]: 743/12362 cut-off events. [2025-03-14 01:43:55,698 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2025-03-14 01:43:55,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14951 conditions, 12362 events. 743/12362 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 125553 event pairs, 118 based on Foata normal form. 0/11372 useless extension candidates. Maximal degree in co-relation 14727. Up to 648 conditions per place. [2025-03-14 01:43:55,917 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 21 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2025-03-14 01:43:55,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 670 transitions, 1688 flow [2025-03-14 01:43:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-03-14 01:43:55,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-03-14 01:43:55,919 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1639 flow. Second operand 3 states and 2235 transitions. [2025-03-14 01:43:55,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 670 transitions, 1688 flow [2025-03-14 01:43:55,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 670 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:55,927 INFO L231 Difference]: Finished difference. Result has 656 places, 669 transitions, 1637 flow [2025-03-14 01:43:55,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=656, PETRI_TRANSITIONS=669} [2025-03-14 01:43:55,928 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -62 predicate places. [2025-03-14 01:43:55,928 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 669 transitions, 1637 flow [2025-03-14 01:43:55,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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-14 01:43:55,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:55,929 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:55,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-14 01:43:55,929 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:55,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:55,930 INFO L85 PathProgramCache]: Analyzing trace with hash 446822384, now seen corresponding path program 1 times [2025-03-14 01:43:55,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:55,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434547571] [2025-03-14 01:43:55,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:55,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:55,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-14 01:43:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-14 01:43:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:55,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434547571] [2025-03-14 01:43:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434547571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:55,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:55,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:43:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297204913] [2025-03-14 01:43:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:55,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:55,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:55,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:55,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-03-14 01:43:55,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 669 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-14 01:43:55,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:55,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-03-14 01:43:55,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:43:58,100 INFO L124 PetriNetUnfolderBase]: 557/11430 cut-off events. [2025-03-14 01:43:58,100 INFO L125 PetriNetUnfolderBase]: For 152/154 co-relation queries the response was YES. [2025-03-14 01:43:58,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 11430 events. 557/11430 cut-off events. For 152/154 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102554 event pairs, 40 based on Foata normal form. 0/10545 useless extension candidates. Maximal degree in co-relation 13179. Up to 205 conditions per place. [2025-03-14 01:43:58,374 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-03-14 01:43:58,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 672 transitions, 1670 flow [2025-03-14 01:43:58,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:43:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:43:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-03-14 01:43:58,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-03-14 01:43:58,376 INFO L175 Difference]: Start difference. First operand has 656 places, 669 transitions, 1637 flow. Second operand 3 states and 2258 transitions. [2025-03-14 01:43:58,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 672 transitions, 1670 flow [2025-03-14 01:43:58,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 672 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:43:58,387 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1653 flow [2025-03-14 01:43:58,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-03-14 01:43:58,388 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-03-14 01:43:58,388 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1653 flow [2025-03-14 01:43:58,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-14 01:43:58,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:43:58,389 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:43:58,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-14 01:43:58,389 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:43:58,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:43:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1735705419, now seen corresponding path program 1 times [2025-03-14 01:43:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:43:58,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867313969] [2025-03-14 01:43:58,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:43:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:43:58,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-14 01:43:58,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-14 01:43:58,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:43:58,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:43:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:43:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:43:58,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867313969] [2025-03-14 01:43:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867313969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:43:58,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:43:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:43:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995088620] [2025-03-14 01:43:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:43:58,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:43:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:43:58,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:43:58,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:43:58,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:43:58,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-14 01:43:58,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:43:58,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:43:58,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:01,746 INFO L124 PetriNetUnfolderBase]: 911/19053 cut-off events. [2025-03-14 01:44:01,746 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-03-14 01:44:01,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22437 conditions, 19053 events. 911/19053 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 198191 event pairs, 71 based on Foata normal form. 0/17655 useless extension candidates. Maximal degree in co-relation 22212. Up to 430 conditions per place. [2025-03-14 01:44:02,025 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2025-03-14 01:44:02,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1694 flow [2025-03-14 01:44:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:44:02,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:44:02,027 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1653 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:44:02,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1694 flow [2025-03-14 01:44:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1688 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:02,038 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1651 flow [2025-03-14 01:44:02,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2025-03-14 01:44:02,039 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2025-03-14 01:44:02,039 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1651 flow [2025-03-14 01:44:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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-14 01:44:02,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:02,039 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:02,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-14 01:44:02,039 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:02,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:02,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2103951620, now seen corresponding path program 1 times [2025-03-14 01:44:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:02,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401694507] [2025-03-14 01:44:02,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:02,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:02,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-14 01:44:02,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-14 01:44:02,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:02,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:02,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401694507] [2025-03-14 01:44:02,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401694507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:02,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:02,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:44:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406349865] [2025-03-14 01:44:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:02,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:02,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:02,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:02,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-03-14 01:44:02,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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-14 01:44:02,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:02,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-03-14 01:44:02,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:04,276 INFO L124 PetriNetUnfolderBase]: 631/11740 cut-off events. [2025-03-14 01:44:04,277 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2025-03-14 01:44:04,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 11740 events. 631/11740 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 114734 event pairs, 59 based on Foata normal form. 0/10819 useless extension candidates. Maximal degree in co-relation 13747. Up to 317 conditions per place. [2025-03-14 01:44:04,472 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2025-03-14 01:44:04,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1684 flow [2025-03-14 01:44:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-03-14 01:44:04,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-03-14 01:44:04,473 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1651 flow. Second operand 3 states and 2258 transitions. [2025-03-14 01:44:04,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1684 flow [2025-03-14 01:44:04,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:04,481 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1667 flow [2025-03-14 01:44:04,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-03-14 01:44:04,482 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-03-14 01:44:04,482 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1667 flow [2025-03-14 01:44:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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-14 01:44:04,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:04,483 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:04,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-14 01:44:04,483 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:04,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash -603188383, now seen corresponding path program 1 times [2025-03-14 01:44:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654155000] [2025-03-14 01:44:04,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:04,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-14 01:44:04,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-14 01:44:04,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:04,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654155000] [2025-03-14 01:44:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654155000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:44:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353884361] [2025-03-14 01:44:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:04,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:04,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:04,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:04,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 773 [2025-03-14 01:44:04,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-14 01:44:04,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:04,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 773 [2025-03-14 01:44:04,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:06,932 INFO L124 PetriNetUnfolderBase]: 747/12434 cut-off events. [2025-03-14 01:44:06,932 INFO L125 PetriNetUnfolderBase]: For 759/763 co-relation queries the response was YES. [2025-03-14 01:44:07,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15468 conditions, 12434 events. 747/12434 cut-off events. For 759/763 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 126014 event pairs, 102 based on Foata normal form. 0/11596 useless extension candidates. Maximal degree in co-relation 15242. Up to 613 conditions per place. [2025-03-14 01:44:07,245 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2025-03-14 01:44:07,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1708 flow [2025-03-14 01:44:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2025-03-14 01:44:07,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646399310047434 [2025-03-14 01:44:07,247 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1667 flow. Second operand 3 states and 2237 transitions. [2025-03-14 01:44:07,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1708 flow [2025-03-14 01:44:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:07,260 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1665 flow [2025-03-14 01:44:07,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1665, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2025-03-14 01:44:07,261 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-03-14 01:44:07,261 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1665 flow [2025-03-14 01:44:07,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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-14 01:44:07,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:07,262 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:07,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-14 01:44:07,262 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:07,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -359925808, now seen corresponding path program 1 times [2025-03-14 01:44:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:07,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961193581] [2025-03-14 01:44:07,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:07,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-14 01:44:07,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-14 01:44:07,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:07,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961193581] [2025-03-14 01:44:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961193581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:07,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:07,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:44:07,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132520617] [2025-03-14 01:44:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:07,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:07,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:07,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:07,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:07,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-03-14 01:44:07,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1665 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-14 01:44:07,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:07,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-03-14 01:44:07,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:09,477 INFO L124 PetriNetUnfolderBase]: 557/11576 cut-off events. [2025-03-14 01:44:09,477 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2025-03-14 01:44:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13858 conditions, 11576 events. 557/11576 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 103142 event pairs, 40 based on Foata normal form. 0/10782 useless extension candidates. Maximal degree in co-relation 13633. Up to 205 conditions per place. [2025-03-14 01:44:09,687 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2025-03-14 01:44:09,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1698 flow [2025-03-14 01:44:09,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-03-14 01:44:09,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-03-14 01:44:09,688 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1665 flow. Second operand 3 states and 2258 transitions. [2025-03-14 01:44:09,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1698 flow [2025-03-14 01:44:09,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:09,698 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1681 flow [2025-03-14 01:44:09,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1681, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2025-03-14 01:44:09,698 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2025-03-14 01:44:09,698 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1681 flow [2025-03-14 01:44:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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-14 01:44:09,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:09,699 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:09,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-14 01:44:09,699 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:09,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 368363541, now seen corresponding path program 1 times [2025-03-14 01:44:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322872356] [2025-03-14 01:44:09,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:09,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:09,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-14 01:44:09,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-14 01:44:09,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:09,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322872356] [2025-03-14 01:44:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322872356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:44:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150488530] [2025-03-14 01:44:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:09,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:09,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:09,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:44:09,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1681 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:44:09,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:09,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:44:09,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:13,640 INFO L124 PetriNetUnfolderBase]: 1079/23272 cut-off events. [2025-03-14 01:44:13,641 INFO L125 PetriNetUnfolderBase]: For 436/438 co-relation queries the response was YES. [2025-03-14 01:44:13,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27821 conditions, 23272 events. 1079/23272 cut-off events. For 436/438 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 253645 event pairs, 68 based on Foata normal form. 0/21765 useless extension candidates. Maximal degree in co-relation 27594. Up to 565 conditions per place. [2025-03-14 01:44:13,919 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 22 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2025-03-14 01:44:13,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1730 flow [2025-03-14 01:44:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-03-14 01:44:13,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-03-14 01:44:13,921 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1681 flow. Second operand 3 states and 2235 transitions. [2025-03-14 01:44:13,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1730 flow [2025-03-14 01:44:13,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:13,935 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1677 flow [2025-03-14 01:44:13,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-03-14 01:44:13,936 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-03-14 01:44:13,936 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1677 flow [2025-03-14 01:44:13,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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-14 01:44:13,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:13,936 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:13,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-14 01:44:13,936 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1321523705, now seen corresponding path program 1 times [2025-03-14 01:44:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384519333] [2025-03-14 01:44:13,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:13,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-14 01:44:13,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-14 01:44:13,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:13,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384519333] [2025-03-14 01:44:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384519333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:13,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:44:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154880829] [2025-03-14 01:44:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:13,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:13,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:13,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:13,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 773 [2025-03-14 01:44:13,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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-14 01:44:13,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:13,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 773 [2025-03-14 01:44:13,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:16,234 INFO L124 PetriNetUnfolderBase]: 623/11884 cut-off events. [2025-03-14 01:44:16,234 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2025-03-14 01:44:16,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14445 conditions, 11884 events. 623/11884 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 115472 event pairs, 59 based on Foata normal form. 0/11074 useless extension candidates. Maximal degree in co-relation 14219. Up to 317 conditions per place. [2025-03-14 01:44:16,374 INFO L140 encePairwiseOnDemand]: 769/773 looper letters, 10 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2025-03-14 01:44:16,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 675 transitions, 1710 flow [2025-03-14 01:44:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2025-03-14 01:44:16,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736955584303579 [2025-03-14 01:44:16,376 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1677 flow. Second operand 3 states and 2258 transitions. [2025-03-14 01:44:16,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 675 transitions, 1710 flow [2025-03-14 01:44:16,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 675 transitions, 1706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:16,384 INFO L231 Difference]: Finished difference. Result has 661 places, 674 transitions, 1695 flow [2025-03-14 01:44:16,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1695, PETRI_PLACES=661, PETRI_TRANSITIONS=674} [2025-03-14 01:44:16,385 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -57 predicate places. [2025-03-14 01:44:16,385 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 674 transitions, 1695 flow [2025-03-14 01:44:16,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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-14 01:44:16,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:16,386 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:16,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-14 01:44:16,386 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1333651102, now seen corresponding path program 1 times [2025-03-14 01:44:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640761184] [2025-03-14 01:44:16,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:16,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-14 01:44:16,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-14 01:44:16,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:16,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640761184] [2025-03-14 01:44:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640761184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:44:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339391555] [2025-03-14 01:44:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:16,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:16,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:16,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:16,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 773 [2025-03-14 01:44:16,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 674 transitions, 1695 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-14 01:44:16,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:16,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 773 [2025-03-14 01:44:16,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:19,054 INFO L124 PetriNetUnfolderBase]: 773/12756 cut-off events. [2025-03-14 01:44:19,055 INFO L125 PetriNetUnfolderBase]: For 755/759 co-relation queries the response was YES. [2025-03-14 01:44:19,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16245 conditions, 12756 events. 773/12756 cut-off events. For 755/759 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 130375 event pairs, 122 based on Foata normal form. 0/12008 useless extension candidates. Maximal degree in co-relation 16017. Up to 694 conditions per place. [2025-03-14 01:44:19,373 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 22 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2025-03-14 01:44:19,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 674 transitions, 1744 flow [2025-03-14 01:44:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2025-03-14 01:44:19,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.963777490297542 [2025-03-14 01:44:19,375 INFO L175 Difference]: Start difference. First operand has 661 places, 674 transitions, 1695 flow. Second operand 3 states and 2235 transitions. [2025-03-14 01:44:19,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 674 transitions, 1744 flow [2025-03-14 01:44:19,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:19,388 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1691 flow [2025-03-14 01:44:19,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2025-03-14 01:44:19,389 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2025-03-14 01:44:19,389 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1691 flow [2025-03-14 01:44:19,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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-14 01:44:19,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:19,390 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:19,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-14 01:44:19,390 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -774532741, now seen corresponding path program 1 times [2025-03-14 01:44:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473116417] [2025-03-14 01:44:19,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:19,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-14 01:44:19,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-14 01:44:19,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:19,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:19,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:19,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473116417] [2025-03-14 01:44:19,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473116417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:19,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:19,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:44:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597289715] [2025-03-14 01:44:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:19,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:19,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:19,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-03-14 01:44:19,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-14 01:44:19,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:19,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-03-14 01:44:19,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:21,415 INFO L124 PetriNetUnfolderBase]: 549/11548 cut-off events. [2025-03-14 01:44:21,415 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2025-03-14 01:44:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14090 conditions, 11548 events. 549/11548 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 107205 event pairs, 41 based on Foata normal form. 0/10900 useless extension candidates. Maximal degree in co-relation 13862. Up to 223 conditions per place. [2025-03-14 01:44:21,627 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 12 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2025-03-14 01:44:21,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1720 flow [2025-03-14 01:44:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2025-03-14 01:44:21,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689521345407504 [2025-03-14 01:44:21,629 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1691 flow. Second operand 3 states and 2247 transitions. [2025-03-14 01:44:21,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1720 flow [2025-03-14 01:44:21,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1716 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:21,640 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1689 flow [2025-03-14 01:44:21,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1685, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1689, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2025-03-14 01:44:21,641 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2025-03-14 01:44:21,641 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1689 flow [2025-03-14 01:44:21,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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-14 01:44:21,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:44:21,641 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:21,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-14 01:44:21,641 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2025-03-14 01:44:21,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:44:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291172, now seen corresponding path program 1 times [2025-03-14 01:44:21,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:44:21,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147875908] [2025-03-14 01:44:21,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:44:21,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:44:21,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-14 01:44:21,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-14 01:44:21,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:44:21,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:44:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-14 01:44:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:44:21,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147875908] [2025-03-14 01:44:21,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147875908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:44:21,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:44:21,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:44:21,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621759583] [2025-03-14 01:44:21,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:44:21,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:44:21,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:44:21,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:44:21,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:44:21,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 773 [2025-03-14 01:44:21,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1689 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-14 01:44:21,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:44:21,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 773 [2025-03-14 01:44:21,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:44:24,322 INFO L124 PetriNetUnfolderBase]: 659/12626 cut-off events. [2025-03-14 01:44:24,322 INFO L125 PetriNetUnfolderBase]: For 200/204 co-relation queries the response was YES. [2025-03-14 01:44:24,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15460 conditions, 12626 events. 659/12626 cut-off events. For 200/204 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 123784 event pairs, 70 based on Foata normal form. 0/11904 useless extension candidates. Maximal degree in co-relation 15232. Up to 307 conditions per place. [2025-03-14 01:44:24,441 INFO L140 encePairwiseOnDemand]: 770/773 looper letters, 0 selfloop transitions, 0 changer transitions 672/672 dead transitions. [2025-03-14 01:44:24,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1718 flow [2025-03-14 01:44:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:44:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:44:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2025-03-14 01:44:24,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689521345407504 [2025-03-14 01:44:24,442 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1689 flow. Second operand 3 states and 2247 transitions. [2025-03-14 01:44:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1718 flow [2025-03-14 01:44:24,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1714 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:44:24,450 INFO L231 Difference]: Finished difference. Result has 658 places, 0 transitions, 0 flow [2025-03-14 01:44:24,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=773, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=658, PETRI_TRANSITIONS=0} [2025-03-14 01:44:24,451 INFO L279 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2025-03-14 01:44:24,451 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 0 transitions, 0 flow [2025-03-14 01:44:24,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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-14 01:44:24,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (189 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (188 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (187 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (186 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (185 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (184 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (183 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (182 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (181 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (180 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (179 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (178 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (177 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (176 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (175 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (174 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (173 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (172 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (171 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (170 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (169 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (168 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (167 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (166 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (165 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (164 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (163 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (162 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (161 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (160 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (159 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (158 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (157 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (156 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (155 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 190 remaining) [2025-03-14 01:44:24,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (153 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (152 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (151 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (150 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (149 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (148 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (147 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (146 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (145 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (144 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (143 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (142 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (141 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (140 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (139 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (138 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (137 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (136 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (135 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (133 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (132 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (131 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (130 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (129 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (128 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (126 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (125 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (124 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (123 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (122 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (121 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (120 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (119 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (118 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (117 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (116 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (111 of 190 remaining) [2025-03-14 01:44:24,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (110 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (108 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (107 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (106 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (105 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (104 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (101 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (100 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (99 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (98 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (97 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (96 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (95 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (94 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (93 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (92 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (91 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (90 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (89 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (85 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (84 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (83 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (82 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (81 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (80 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (79 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (78 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (77 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (76 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (74 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (72 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (70 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 190 remaining) [2025-03-14 01:44:24,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (67 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (66 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (63 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (62 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (61 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (60 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (59 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (58 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (57 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (56 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (55 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (54 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (53 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (51 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (50 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (49 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (48 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err42ASSERT_VIOLATIONDATA_RACE (42 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err41ASSERT_VIOLATIONDATA_RACE (41 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err40ASSERT_VIOLATIONDATA_RACE (40 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err39ASSERT_VIOLATIONDATA_RACE (39 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err38ASSERT_VIOLATIONDATA_RACE (38 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err37ASSERT_VIOLATIONDATA_RACE (37 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err36ASSERT_VIOLATIONDATA_RACE (36 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (35 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (34 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (33 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (31 of 190 remaining) [2025-03-14 01:44:24,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (29 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (27 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (26 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (25 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (24 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (22 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (21 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (20 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (19 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (18 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (17 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (16 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (15 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (13 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 190 remaining) [2025-03-14 01:44:24,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (11 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (10 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (1 of 190 remaining) [2025-03-14 01:44:24,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 190 remaining) [2025-03-14 01:44:24,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-14 01:44:24,463 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:44:24,469 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:44:24,469 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:44:24,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:44:24 BasicIcfg [2025-03-14 01:44:24,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:44:24,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:44:24,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:44:24,479 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:44:24,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:57" (3/4) ... [2025-03-14 01:44:24,480 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:44:24,483 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:44:24,483 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:44:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-14 01:44:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:44:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:44:24,488 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:44:24,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:44:24,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:44:24,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:44:24,557 INFO L158 Benchmark]: Toolchain (without parser) took 88306.51ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 105.5MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 585.4MB. Max. memory is 16.1GB. [2025-03-14 01:44:24,557 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:44:24,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.81ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-14 01:44:24,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.32ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:44:24,557 INFO L158 Benchmark]: Boogie Preprocessor took 45.92ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 85.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:44:24,557 INFO L158 Benchmark]: IcfgBuilder took 771.04ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 41.2MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-14 01:44:24,558 INFO L158 Benchmark]: TraceAbstraction took 87087.31ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 40.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2025-03-14 01:44:24,558 INFO L158 Benchmark]: Witness Printer took 77.83ms. Allocated memory is still 3.5GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:44:24,560 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.16ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.81ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 91.5MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.32ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.92ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 85.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 771.04ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 41.2MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 87087.31ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 40.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 77.83ms. Allocated memory is still 3.5GB. Free memory was 2.9GB in the beginning and 2.9GB 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: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 62]: 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: 63]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 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: 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: 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: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 72]: 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: 75]: 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: 75]: 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: 76]: 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: 76]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 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: 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: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: 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: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1258 locations, 190 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: 86.9s, OverallIterations: 56, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 81.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3352 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1229 mSDsluCounter, 857 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3576 IncrementalHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 652 mSDtfsCounter, 3576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=53, InterpolantAutomatonStates: 191, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 11001 NumberOfCodeBlocks, 10956 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 11159 ConstructedInterpolants, 0 QuantifiedInterpolants, 12186 SizeOfPredicates, 5 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 58 InterpolantComputations, 55 PerfectInterpolantSequences, 1056/1059 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 102 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:44:24,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE