./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-trans.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-match-trans.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 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:42:50,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:42:50,227 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:50,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:42:50,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:42:50,251 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:42:50,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:42:50,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:42:50,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:42:50,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:42:50,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:42:50,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:42:50,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:42:50,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:42:50,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:42:50,254 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:42:50,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:42:50,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:50,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:42:50,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:42:50,256 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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2025-03-14 01:42:50,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:42:50,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:42:50,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:42:50,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:42:50,491 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:42:50,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-03-14 01:42:51,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0bcebc/4132872a00604e69b54719242e016315/FLAGc3a0583f5 [2025-03-14 01:42:51,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:42:51,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-03-14 01:42:51,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0bcebc/4132872a00604e69b54719242e016315/FLAGc3a0583f5 [2025-03-14 01:42:51,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d0bcebc/4132872a00604e69b54719242e016315 [2025-03-14 01:42:51,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:42:51,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:42:51,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:51,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:42:51,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:42:51,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:51" (1/1) ... [2025-03-14 01:42:51,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dece665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:51, skipping insertion in model container [2025-03-14 01:42:51,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:42:51" (1/1) ... [2025-03-14 01:42:51,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:42:52,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:52,050 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:42:52,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:42:52,088 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:42:52,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:52 WrapperNode [2025-03-14 01:42:52,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:42:52,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:52,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:42:52,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:42:52,096 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:52" (1/1) ... [2025-03-14 01:42:52,104 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:52" (1/1) ... [2025-03-14 01:42:52,133 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 319 [2025-03-14 01:42:52,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:42:52,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:42:52,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:42:52,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:42:52,141 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:52" (1/1) ... [2025-03-14 01:42:52,142 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:52" (1/1) ... [2025-03-14 01:42:52,143 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:52" (1/1) ... [2025-03-14 01:42:52,147 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:52" (1/1) ... [2025-03-14 01:42:52,152 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:52" (1/1) ... [2025-03-14 01:42:52,156 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:52" (1/1) ... [2025-03-14 01:42:52,157 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:52" (1/1) ... [2025-03-14 01:42:52,162 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:52" (1/1) ... [2025-03-14 01:42:52,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:42:52,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:42:52,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:42:52,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:42:52,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:52" (1/1) ... [2025-03-14 01:42:52,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:42:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:42:52,206 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:52,212 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:52,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:42:52,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:42:52,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:42:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:42:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:42:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:42:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:42:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:42:52,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:42:52,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:42:52,239 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:52,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:42:52,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:42:52,706 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:42:52,707 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:42:52,707 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:42:52,734 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:42:52,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:52 BoogieIcfgContainer [2025-03-14 01:42:52,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:42:52,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:42:52,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:42:52,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:42:52,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:42:51" (1/3) ... [2025-03-14 01:42:52,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a187e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:52, skipping insertion in model container [2025-03-14 01:42:52,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:42:52" (2/3) ... [2025-03-14 01:42:52,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a187e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:42:52, skipping insertion in model container [2025-03-14 01:42:52,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:42:52" (3/3) ... [2025-03-14 01:42:52,744 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2025-03-14 01:42:52,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:42:52,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-trans.wvr.c that has 4 procedures, 428 locations, 1 initial locations, 0 loop locations, and 39 error locations. [2025-03-14 01:42:52,762 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:42:52,871 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:42:52,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 445 transitions, 911 flow [2025-03-14 01:42:53,080 INFO L124 PetriNetUnfolderBase]: 18/442 cut-off events. [2025-03-14 01:42:53,083 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:42:53,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 442 events. 18/442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 814 event pairs, 0 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 311. Up to 2 conditions per place. [2025-03-14 01:42:53,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 445 transitions, 911 flow [2025-03-14 01:42:53,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 421 transitions, 860 flow [2025-03-14 01:42:53,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:42:53,136 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;@78d51d83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:42:53,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-03-14 01:42:53,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:42:53,142 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-14 01:42:53,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:42:53,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:53,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:53,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:53,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash 537215367, now seen corresponding path program 1 times [2025-03-14 01:42:53,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:53,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716795729] [2025-03-14 01:42:53,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:53,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:42:53,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:42:53,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:53,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:53,290 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:53,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716795729] [2025-03-14 01:42:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716795729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385595919] [2025-03-14 01:42:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:53,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:53,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:53,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:53,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2025-03-14 01:42:53,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 421 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:53,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:53,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2025-03-14 01:42:53,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:53,537 INFO L124 PetriNetUnfolderBase]: 20/802 cut-off events. [2025-03-14 01:42:53,537 INFO L125 PetriNetUnfolderBase]: For 26/30 co-relation queries the response was YES. [2025-03-14 01:42:53,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 802 events. 20/802 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2911 event pairs, 12 based on Foata normal form. 75/765 useless extension candidates. Maximal degree in co-relation 704. Up to 38 conditions per place. [2025-03-14 01:42:53,546 INFO L140 encePairwiseOnDemand]: 430/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2025-03-14 01:42:53,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 408 transitions, 864 flow [2025-03-14 01:42:53,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-03-14 01:42:53,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951310861423221 [2025-03-14 01:42:53,562 INFO L175 Difference]: Start difference. First operand has 415 places, 421 transitions, 860 flow. Second operand 3 states and 1270 transitions. [2025-03-14 01:42:53,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 408 transitions, 864 flow [2025-03-14 01:42:53,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 408 transitions, 852 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:42:53,577 INFO L231 Difference]: Finished difference. Result has 410 places, 408 transitions, 826 flow [2025-03-14 01:42:53,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=410, PETRI_TRANSITIONS=408} [2025-03-14 01:42:53,583 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -5 predicate places. [2025-03-14 01:42:53,583 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 408 transitions, 826 flow [2025-03-14 01:42:53,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:53,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:53,585 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] [2025-03-14 01:42:53,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:42:53,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:53,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1769287360, now seen corresponding path program 1 times [2025-03-14 01:42:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478806489] [2025-03-14 01:42:53,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:53,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:42:53,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:42:53,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:53,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:53,644 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:53,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478806489] [2025-03-14 01:42:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478806489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:53,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869140543] [2025-03-14 01:42:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:53,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:53,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:53,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:53,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:53,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-03-14 01:42:53,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 408 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:53,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:53,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-03-14 01:42:53,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:53,775 INFO L124 PetriNetUnfolderBase]: 12/681 cut-off events. [2025-03-14 01:42:53,775 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:53,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 681 events. 12/681 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2573 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 677. Up to 22 conditions per place. [2025-03-14 01:42:53,783 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2025-03-14 01:42:53,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 407 transitions, 850 flow [2025-03-14 01:42:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-14 01:42:53,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-03-14 01:42:53,786 INFO L175 Difference]: Start difference. First operand has 410 places, 408 transitions, 826 flow. Second operand 3 states and 1262 transitions. [2025-03-14 01:42:53,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 407 transitions, 850 flow [2025-03-14 01:42:53,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 407 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:53,792 INFO L231 Difference]: Finished difference. Result has 409 places, 407 transitions, 824 flow [2025-03-14 01:42:53,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=409, PETRI_TRANSITIONS=407} [2025-03-14 01:42:53,793 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -6 predicate places. [2025-03-14 01:42:53,793 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 407 transitions, 824 flow [2025-03-14 01:42:53,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:53,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:53,794 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] [2025-03-14 01:42:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:42:53,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1774690104, now seen corresponding path program 1 times [2025-03-14 01:42:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800820601] [2025-03-14 01:42:53,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:53,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:42:53,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:42:53,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:53,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:53,844 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:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:53,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800820601] [2025-03-14 01:42:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800820601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:53,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:53,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:53,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119741767] [2025-03-14 01:42:53,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:53,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:53,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:53,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:53,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-03-14 01:42:53,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 407 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:53,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:53,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-03-14 01:42:53,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:53,976 INFO L124 PetriNetUnfolderBase]: 12/671 cut-off events. [2025-03-14 01:42:53,976 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:42:53,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 671 events. 12/671 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2508 event pairs, 5 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 659. Up to 22 conditions per place. [2025-03-14 01:42:53,985 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2025-03-14 01:42:53,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 406 transitions, 848 flow [2025-03-14 01:42:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-14 01:42:53,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-03-14 01:42:53,988 INFO L175 Difference]: Start difference. First operand has 409 places, 407 transitions, 824 flow. Second operand 3 states and 1262 transitions. [2025-03-14 01:42:53,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 406 transitions, 848 flow [2025-03-14 01:42:53,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 406 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:53,993 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 822 flow [2025-03-14 01:42:53,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2025-03-14 01:42:53,994 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -7 predicate places. [2025-03-14 01:42:53,994 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 822 flow [2025-03-14 01:42:53,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:53,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:53,995 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] [2025-03-14 01:42:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:42:53,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -802049167, now seen corresponding path program 1 times [2025-03-14 01:42:53,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534034751] [2025-03-14 01:42:53,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:54,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:42:54,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:42:54,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:54,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:54,032 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:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534034751] [2025-03-14 01:42:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534034751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819461346] [2025-03-14 01:42:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:54,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:54,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:54,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:54,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2025-03-14 01:42:54,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:54,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:54,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2025-03-14 01:42:54,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:54,257 INFO L124 PetriNetUnfolderBase]: 34/1363 cut-off events. [2025-03-14 01:42:54,257 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-14 01:42:54,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1363 events. 34/1363 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6151 event pairs, 20 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1379. Up to 50 conditions per place. [2025-03-14 01:42:54,271 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2025-03-14 01:42:54,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 405 transitions, 850 flow [2025-03-14 01:42:54,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2025-03-14 01:42:54,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2025-03-14 01:42:54,275 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 822 flow. Second operand 3 states and 1258 transitions. [2025-03-14 01:42:54,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 405 transitions, 850 flow [2025-03-14 01:42:54,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 405 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:54,280 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 820 flow [2025-03-14 01:42:54,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-03-14 01:42:54,281 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -8 predicate places. [2025-03-14 01:42:54,281 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 820 flow [2025-03-14 01:42:54,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:54,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:54,282 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] [2025-03-14 01:42:54,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:42:54,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:54,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash 41935845, now seen corresponding path program 1 times [2025-03-14 01:42:54,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:54,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425383719] [2025-03-14 01:42:54,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:54,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-14 01:42:54,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-14 01:42:54,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:54,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:54,335 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:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:54,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425383719] [2025-03-14 01:42:54,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425383719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299244976] [2025-03-14 01:42:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:54,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:54,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:54,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-03-14 01:42:54,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:54,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:54,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-03-14 01:42:54,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:54,469 INFO L124 PetriNetUnfolderBase]: 16/867 cut-off events. [2025-03-14 01:42:54,470 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-14 01:42:54,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 867 events. 16/867 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3232 event pairs, 7 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 844. Up to 25 conditions per place. [2025-03-14 01:42:54,479 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-14 01:42:54,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 844 flow [2025-03-14 01:42:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-14 01:42:54,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-03-14 01:42:54,482 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 820 flow. Second operand 3 states and 1262 transitions. [2025-03-14 01:42:54,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 844 flow [2025-03-14 01:42:54,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 404 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:54,487 INFO L231 Difference]: Finished difference. Result has 406 places, 404 transitions, 818 flow [2025-03-14 01:42:54,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=406, PETRI_TRANSITIONS=404} [2025-03-14 01:42:54,490 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2025-03-14 01:42:54,492 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 404 transitions, 818 flow [2025-03-14 01:42:54,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:54,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:54,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:54,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:42:54,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:54,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 435134981, now seen corresponding path program 1 times [2025-03-14 01:42:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280065460] [2025-03-14 01:42:54,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:54,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:54,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:42:54,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:42:54,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:54,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:54,549 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:54,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:54,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280065460] [2025-03-14 01:42:54,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280065460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:54,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:54,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:54,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759707428] [2025-03-14 01:42:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:54,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:54,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-03-14 01:42:54,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 404 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:54,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:54,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-03-14 01:42:54,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:54,679 INFO L124 PetriNetUnfolderBase]: 16/857 cut-off events. [2025-03-14 01:42:54,680 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-14 01:42:54,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 857 events. 16/857 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3195 event pairs, 7 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 826. Up to 25 conditions per place. [2025-03-14 01:42:54,690 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2025-03-14 01:42:54,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 403 transitions, 842 flow [2025-03-14 01:42:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-14 01:42:54,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-03-14 01:42:54,693 INFO L175 Difference]: Start difference. First operand has 406 places, 404 transitions, 818 flow. Second operand 3 states and 1262 transitions. [2025-03-14 01:42:54,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 403 transitions, 842 flow [2025-03-14 01:42:54,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 403 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:54,699 INFO L231 Difference]: Finished difference. Result has 405 places, 403 transitions, 816 flow [2025-03-14 01:42:54,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=405, PETRI_TRANSITIONS=403} [2025-03-14 01:42:54,701 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-03-14 01:42:54,702 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 403 transitions, 816 flow [2025-03-14 01:42:54,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:54,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:54,703 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] [2025-03-14 01:42:54,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:42:54,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1002215405, now seen corresponding path program 1 times [2025-03-14 01:42:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:54,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307327772] [2025-03-14 01:42:54,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:54,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-14 01:42:54,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-14 01:42:54,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:54,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:54,763 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:54,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307327772] [2025-03-14 01:42:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307327772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028232255] [2025-03-14 01:42:54,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:54,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:54,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:54,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 445 [2025-03-14 01:42:54,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 403 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:54,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:54,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 445 [2025-03-14 01:42:54,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:54,873 INFO L124 PetriNetUnfolderBase]: 27/638 cut-off events. [2025-03-14 01:42:54,873 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2025-03-14 01:42:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 638 events. 27/638 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2307 event pairs, 20 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 622. Up to 50 conditions per place. [2025-03-14 01:42:54,883 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:54,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 402 transitions, 844 flow [2025-03-14 01:42:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1258 transitions. [2025-03-14 01:42:54,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423220973782771 [2025-03-14 01:42:54,887 INFO L175 Difference]: Start difference. First operand has 405 places, 403 transitions, 816 flow. Second operand 3 states and 1258 transitions. [2025-03-14 01:42:54,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 402 transitions, 844 flow [2025-03-14 01:42:54,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:54,894 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 814 flow [2025-03-14 01:42:54,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2025-03-14 01:42:54,895 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2025-03-14 01:42:54,895 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 814 flow [2025-03-14 01:42:54,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states 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:54,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:54,896 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] [2025-03-14 01:42:54,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:42:54,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1496795383, now seen corresponding path program 1 times [2025-03-14 01:42:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913259447] [2025-03-14 01:42:54,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:54,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-14 01:42:54,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-14 01:42:54,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:54,949 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:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913259447] [2025-03-14 01:42:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913259447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899001541] [2025-03-14 01:42:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:54,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:54,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:54,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:54,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-03-14 01:42:54,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:54,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:54,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-03-14 01:42:54,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:55,054 INFO L124 PetriNetUnfolderBase]: 15/673 cut-off events. [2025-03-14 01:42:55,054 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-14 01:42:55,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 673 events. 15/673 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1764 event pairs, 7 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 623. Up to 25 conditions per place. [2025-03-14 01:42:55,062 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-03-14 01:42:55,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 401 transitions, 838 flow [2025-03-14 01:42:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-14 01:42:55,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-03-14 01:42:55,065 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 814 flow. Second operand 3 states and 1262 transitions. [2025-03-14 01:42:55,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 401 transitions, 838 flow [2025-03-14 01:42:55,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:55,070 INFO L231 Difference]: Finished difference. Result has 403 places, 401 transitions, 812 flow [2025-03-14 01:42:55,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=403, PETRI_TRANSITIONS=401} [2025-03-14 01:42:55,072 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2025-03-14 01:42:55,072 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 401 transitions, 812 flow [2025-03-14 01:42:55,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:55,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:55,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:42:55,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:55,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash -97840910, now seen corresponding path program 1 times [2025-03-14 01:42:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390459634] [2025-03-14 01:42:55,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:55,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:42:55,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:42:55,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:55,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:55,120 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:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:55,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390459634] [2025-03-14 01:42:55,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390459634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:55,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:55,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847563088] [2025-03-14 01:42:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:55,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:55,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:55,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:55,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 445 [2025-03-14 01:42:55,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:55,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:55,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 445 [2025-03-14 01:42:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:55,228 INFO L124 PetriNetUnfolderBase]: 15/663 cut-off events. [2025-03-14 01:42:55,228 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-14 01:42:55,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 663 events. 15/663 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1734 event pairs, 7 based on Foata normal form. 0/574 useless extension candidates. Maximal degree in co-relation 605. Up to 25 conditions per place. [2025-03-14 01:42:55,234 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-03-14 01:42:55,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 836 flow [2025-03-14 01:42:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2025-03-14 01:42:55,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453183520599251 [2025-03-14 01:42:55,237 INFO L175 Difference]: Start difference. First operand has 403 places, 401 transitions, 812 flow. Second operand 3 states and 1262 transitions. [2025-03-14 01:42:55,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 836 flow [2025-03-14 01:42:55,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 400 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:55,243 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 810 flow [2025-03-14 01:42:55,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2025-03-14 01:42:55,245 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-03-14 01:42:55,245 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 810 flow [2025-03-14 01:42:55,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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:55,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:55,246 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] [2025-03-14 01:42:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:42:55,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:55,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1152588652, now seen corresponding path program 1 times [2025-03-14 01:42:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221236088] [2025-03-14 01:42:55,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:55,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-14 01:42:55,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-14 01:42:55,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:55,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:55,313 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:55,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:55,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221236088] [2025-03-14 01:42:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221236088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:55,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614918642] [2025-03-14 01:42:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:55,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:55,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:55,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:55,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:55,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-03-14 01:42:55,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states 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:55,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:55,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-03-14 01:42:55,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:55,450 INFO L124 PetriNetUnfolderBase]: 21/852 cut-off events. [2025-03-14 01:42:55,451 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:42:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 852 events. 21/852 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3575 event pairs, 6 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 798. Up to 31 conditions per place. [2025-03-14 01:42:55,460 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:55,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 846 flow [2025-03-14 01:42:55,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:55,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:55,463 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 810 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:55,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 846 flow [2025-03-14 01:42:55,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 402 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:55,468 INFO L231 Difference]: Finished difference. Result has 401 places, 400 transitions, 816 flow [2025-03-14 01:42:55,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=401, PETRI_TRANSITIONS=400} [2025-03-14 01:42:55,469 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-03-14 01:42:55,469 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 400 transitions, 816 flow [2025-03-14 01:42:55,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states 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:55,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:42:55,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:55,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash 463895477, now seen corresponding path program 1 times [2025-03-14 01:42:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621755807] [2025-03-14 01:42:55,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:55,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:42:55,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:42:55,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621755807] [2025-03-14 01:42:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621755807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:55,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248112247] [2025-03-14 01:42:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:55,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:55,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:55,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-03-14 01:42:55,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 400 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states 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:55,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:55,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-03-14 01:42:55,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:55,655 INFO L124 PetriNetUnfolderBase]: 24/1006 cut-off events. [2025-03-14 01:42:55,655 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:42:55,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1006 events. 24/1006 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4928 event pairs, 6 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 857. Up to 33 conditions per place. [2025-03-14 01:42:55,668 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:55,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 402 transitions, 852 flow [2025-03-14 01:42:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:55,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:55,671 INFO L175 Difference]: Start difference. First operand has 401 places, 400 transitions, 816 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 402 transitions, 852 flow [2025-03-14 01:42:55,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 402 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:55,677 INFO L231 Difference]: Finished difference. Result has 402 places, 400 transitions, 826 flow [2025-03-14 01:42:55,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=402, PETRI_TRANSITIONS=400} [2025-03-14 01:42:55,678 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-03-14 01:42:55,678 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 400 transitions, 826 flow [2025-03-14 01:42:55,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states 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:55,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:55,679 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] [2025-03-14 01:42:55,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:42:55,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1458709833, now seen corresponding path program 1 times [2025-03-14 01:42:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804803792] [2025-03-14 01:42:55,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:55,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-14 01:42:55,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-14 01:42:55,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:55,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:55,727 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:55,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:55,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804803792] [2025-03-14 01:42:55,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804803792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13648834] [2025-03-14 01:42:55,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:55,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:55,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:55,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:55,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:55,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-03-14 01:42:55,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 400 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:55,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:55,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-03-14 01:42:55,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:55,917 INFO L124 PetriNetUnfolderBase]: 44/1634 cut-off events. [2025-03-14 01:42:55,918 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-03-14 01:42:55,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1634 events. 44/1634 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10900 event pairs, 11 based on Foata normal form. 0/1413 useless extension candidates. Maximal degree in co-relation 1432. Up to 43 conditions per place. [2025-03-14 01:42:55,931 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:55,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 402 transitions, 862 flow [2025-03-14 01:42:55,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:55,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:55,933 INFO L175 Difference]: Start difference. First operand has 402 places, 400 transitions, 826 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:55,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 402 transitions, 862 flow [2025-03-14 01:42:55,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 402 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:55,938 INFO L231 Difference]: Finished difference. Result has 403 places, 400 transitions, 836 flow [2025-03-14 01:42:55,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=403, PETRI_TRANSITIONS=400} [2025-03-14 01:42:55,939 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2025-03-14 01:42:55,940 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 400 transitions, 836 flow [2025-03-14 01:42:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:55,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:55,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:55,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:42:55,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:55,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1660841706, now seen corresponding path program 1 times [2025-03-14 01:42:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:55,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199825435] [2025-03-14 01:42:55,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:55,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:42:55,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:42:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:55,967 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:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199825435] [2025-03-14 01:42:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199825435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:55,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323995749] [2025-03-14 01:42:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:55,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:55,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:55,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-03-14 01:42:55,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 400 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:55,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:55,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-03-14 01:42:55,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:56,138 INFO L124 PetriNetUnfolderBase]: 42/1269 cut-off events. [2025-03-14 01:42:56,138 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-03-14 01:42:56,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1269 events. 42/1269 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7615 event pairs, 5 based on Foata normal form. 0/1102 useless extension candidates. Maximal degree in co-relation 1159. Up to 50 conditions per place. [2025-03-14 01:42:56,147 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:56,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 872 flow [2025-03-14 01:42:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:56,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:56,150 INFO L175 Difference]: Start difference. First operand has 403 places, 400 transitions, 836 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:56,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 872 flow [2025-03-14 01:42:56,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 402 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:56,154 INFO L231 Difference]: Finished difference. Result has 404 places, 400 transitions, 846 flow [2025-03-14 01:42:56,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=404, PETRI_TRANSITIONS=400} [2025-03-14 01:42:56,155 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2025-03-14 01:42:56,155 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 400 transitions, 846 flow [2025-03-14 01:42:56,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:56,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:56,156 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] [2025-03-14 01:42:56,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:42:56,156 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:56,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash 398261753, now seen corresponding path program 1 times [2025-03-14 01:42:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:56,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815855427] [2025-03-14 01:42:56,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:56,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:56,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-14 01:42:56,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-14 01:42:56,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:56,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:56,207 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:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815855427] [2025-03-14 01:42:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815855427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308191502] [2025-03-14 01:42:56,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:56,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:56,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:56,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:56,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-03-14 01:42:56,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 400 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:56,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:56,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-03-14 01:42:56,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:56,412 INFO L124 PetriNetUnfolderBase]: 61/1652 cut-off events. [2025-03-14 01:42:56,412 INFO L125 PetriNetUnfolderBase]: For 19/25 co-relation queries the response was YES. [2025-03-14 01:42:56,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1652 events. 61/1652 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9930 event pairs, 18 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1523. Up to 70 conditions per place. [2025-03-14 01:42:56,426 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:56,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 402 transitions, 882 flow [2025-03-14 01:42:56,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:56,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:56,430 INFO L175 Difference]: Start difference. First operand has 404 places, 400 transitions, 846 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:56,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 402 transitions, 882 flow [2025-03-14 01:42:56,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 402 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:56,437 INFO L231 Difference]: Finished difference. Result has 405 places, 400 transitions, 856 flow [2025-03-14 01:42:56,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=405, PETRI_TRANSITIONS=400} [2025-03-14 01:42:56,438 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-03-14 01:42:56,438 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 400 transitions, 856 flow [2025-03-14 01:42:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:56,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:56,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:56,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:42:56,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:56,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:56,440 INFO L85 PathProgramCache]: Analyzing trace with hash 477487066, now seen corresponding path program 1 times [2025-03-14 01:42:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:56,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18017275] [2025-03-14 01:42:56,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:56,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-14 01:42:56,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-14 01:42:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:56,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:56,492 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:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18017275] [2025-03-14 01:42:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18017275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619313966] [2025-03-14 01:42:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:56,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:56,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:56,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:56,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 445 [2025-03-14 01:42:56,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 400 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:56,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:56,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 445 [2025-03-14 01:42:56,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:56,769 INFO L124 PetriNetUnfolderBase]: 70/1820 cut-off events. [2025-03-14 01:42:56,770 INFO L125 PetriNetUnfolderBase]: For 21/27 co-relation queries the response was YES. [2025-03-14 01:42:56,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 1820 events. 70/1820 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 11197 event pairs, 10 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 1718. Up to 80 conditions per place. [2025-03-14 01:42:56,793 INFO L140 encePairwiseOnDemand]: 441/445 looper letters, 13 selfloop transitions, 2 changer transitions 0/402 dead transitions. [2025-03-14 01:42:56,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 402 transitions, 892 flow [2025-03-14 01:42:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:56,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:56,796 INFO L175 Difference]: Start difference. First operand has 405 places, 400 transitions, 856 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:56,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 402 transitions, 892 flow [2025-03-14 01:42:56,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 402 transitions, 892 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:56,801 INFO L231 Difference]: Finished difference. Result has 406 places, 400 transitions, 866 flow [2025-03-14 01:42:56,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=406, PETRI_TRANSITIONS=400} [2025-03-14 01:42:56,802 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -9 predicate places. [2025-03-14 01:42:56,802 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 400 transitions, 866 flow [2025-03-14 01:42:56,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states 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:56,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:56,803 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] [2025-03-14 01:42:56,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:42:56,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 405468020, now seen corresponding path program 1 times [2025-03-14 01:42:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:56,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555492058] [2025-03-14 01:42:56,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:56,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-14 01:42:56,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-14 01:42:56,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:56,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:56,862 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:56,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:56,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555492058] [2025-03-14 01:42:56,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555492058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:56,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:56,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520358890] [2025-03-14 01:42:56,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:56,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:56,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:56,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:56,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:56,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2025-03-14 01:42:56,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 400 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:56,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:56,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2025-03-14 01:42:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:57,062 INFO L124 PetriNetUnfolderBase]: 178/1862 cut-off events. [2025-03-14 01:42:57,063 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:42:57,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1862 events. 178/1862 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13090 event pairs, 84 based on Foata normal form. 0/1590 useless extension candidates. Maximal degree in co-relation 1917. Up to 293 conditions per place. [2025-03-14 01:42:57,079 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-03-14 01:42:57,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 400 transitions, 906 flow [2025-03-14 01:42:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:57,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-03-14 01:42:57,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2025-03-14 01:42:57,082 INFO L175 Difference]: Start difference. First operand has 406 places, 400 transitions, 866 flow. Second operand 3 states and 1259 transitions. [2025-03-14 01:42:57,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 400 transitions, 906 flow [2025-03-14 01:42:57,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 400 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:57,088 INFO L231 Difference]: Finished difference. Result has 405 places, 398 transitions, 872 flow [2025-03-14 01:42:57,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=405, PETRI_TRANSITIONS=398} [2025-03-14 01:42:57,089 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-03-14 01:42:57,089 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 398 transitions, 872 flow [2025-03-14 01:42:57,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:57,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:57,090 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] [2025-03-14 01:42:57,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:42:57,090 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:57,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1187226859, now seen corresponding path program 1 times [2025-03-14 01:42:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:57,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218068346] [2025-03-14 01:42:57,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:57,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-14 01:42:57,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-14 01:42:57,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:57,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:57,138 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:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218068346] [2025-03-14 01:42:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218068346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:57,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310848925] [2025-03-14 01:42:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:57,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:57,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:57,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:57,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2025-03-14 01:42:57,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 398 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:57,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:57,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2025-03-14 01:42:57,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:57,349 INFO L124 PetriNetUnfolderBase]: 123/1527 cut-off events. [2025-03-14 01:42:57,349 INFO L125 PetriNetUnfolderBase]: For 12/42 co-relation queries the response was YES. [2025-03-14 01:42:57,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1527 events. 123/1527 cut-off events. For 12/42 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9651 event pairs, 28 based on Foata normal form. 1/1353 useless extension candidates. Maximal degree in co-relation 1543. Up to 152 conditions per place. [2025-03-14 01:42:57,360 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/398 dead transitions. [2025-03-14 01:42:57,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 398 transitions, 912 flow [2025-03-14 01:42:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-03-14 01:42:57,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2025-03-14 01:42:57,363 INFO L175 Difference]: Start difference. First operand has 405 places, 398 transitions, 872 flow. Second operand 3 states and 1259 transitions. [2025-03-14 01:42:57,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 398 transitions, 912 flow [2025-03-14 01:42:57,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 398 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:57,367 INFO L231 Difference]: Finished difference. Result has 404 places, 396 transitions, 878 flow [2025-03-14 01:42:57,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=404, PETRI_TRANSITIONS=396} [2025-03-14 01:42:57,367 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -11 predicate places. [2025-03-14 01:42:57,367 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 396 transitions, 878 flow [2025-03-14 01:42:57,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:57,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:57,369 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] [2025-03-14 01:42:57,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:42:57,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2093134397, now seen corresponding path program 1 times [2025-03-14 01:42:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:57,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118389797] [2025-03-14 01:42:57,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:57,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-14 01:42:57,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-14 01:42:57,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:57,411 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:57,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118389797] [2025-03-14 01:42:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118389797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:57,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:57,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461320051] [2025-03-14 01:42:57,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:57,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:57,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:57,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:57,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:57,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2025-03-14 01:42:57,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 396 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states 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:57,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:57,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2025-03-14 01:42:57,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:57,566 INFO L124 PetriNetUnfolderBase]: 60/1524 cut-off events. [2025-03-14 01:42:57,566 INFO L125 PetriNetUnfolderBase]: For 5/20 co-relation queries the response was YES. [2025-03-14 01:42:57,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1524 events. 60/1524 cut-off events. For 5/20 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8549 event pairs, 8 based on Foata normal form. 2/1374 useless extension candidates. Maximal degree in co-relation 1416. Up to 38 conditions per place. [2025-03-14 01:42:57,581 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-03-14 01:42:57,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 397 transitions, 908 flow [2025-03-14 01:42:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:57,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:57,583 INFO L175 Difference]: Start difference. First operand has 404 places, 396 transitions, 878 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:57,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 397 transitions, 908 flow [2025-03-14 01:42:57,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 397 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:57,589 INFO L231 Difference]: Finished difference. Result has 405 places, 395 transitions, 880 flow [2025-03-14 01:42:57,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=405, PETRI_TRANSITIONS=395} [2025-03-14 01:42:57,590 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -10 predicate places. [2025-03-14 01:42:57,590 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 395 transitions, 880 flow [2025-03-14 01:42:57,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states 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:57,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:57,590 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] [2025-03-14 01:42:57,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:42:57,591 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:57,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash -207219638, now seen corresponding path program 1 times [2025-03-14 01:42:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269167961] [2025-03-14 01:42:57,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:57,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-14 01:42:57,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-14 01:42:57,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:57,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:57,629 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:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:57,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269167961] [2025-03-14 01:42:57,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269167961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:57,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:57,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:57,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118632492] [2025-03-14 01:42:57,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:57,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:57,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:57,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:57,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 445 [2025-03-14 01:42:57,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 395 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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:57,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:57,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 445 [2025-03-14 01:42:57,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:57,858 INFO L124 PetriNetUnfolderBase]: 222/1927 cut-off events. [2025-03-14 01:42:57,858 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2025-03-14 01:42:57,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1927 events. 222/1927 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12349 event pairs, 76 based on Foata normal form. 0/1735 useless extension candidates. Maximal degree in co-relation 2166. Up to 346 conditions per place. [2025-03-14 01:42:57,873 INFO L140 encePairwiseOnDemand]: 439/445 looper letters, 17 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2025-03-14 01:42:57,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 395 transitions, 920 flow [2025-03-14 01:42:57,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-03-14 01:42:57,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9430711610486892 [2025-03-14 01:42:57,875 INFO L175 Difference]: Start difference. First operand has 405 places, 395 transitions, 880 flow. Second operand 3 states and 1259 transitions. [2025-03-14 01:42:57,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 395 transitions, 920 flow [2025-03-14 01:42:57,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 395 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:57,880 INFO L231 Difference]: Finished difference. Result has 402 places, 393 transitions, 882 flow [2025-03-14 01:42:57,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=393} [2025-03-14 01:42:57,880 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-03-14 01:42:57,880 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 393 transitions, 882 flow [2025-03-14 01:42:57,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.6666666666667) internal successors, (1241), 3 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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:57,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:57,881 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] [2025-03-14 01:42:57,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:42:57,881 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:57,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2124956402, now seen corresponding path program 1 times [2025-03-14 01:42:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267031102] [2025-03-14 01:42:57,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:57,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-14 01:42:57,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-14 01:42:57,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:57,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:57,928 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:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267031102] [2025-03-14 01:42:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267031102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:57,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839861139] [2025-03-14 01:42:57,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:57,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:57,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:57,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:57,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:57,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2025-03-14 01:42:57,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 393 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states 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:57,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:57,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2025-03-14 01:42:57,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:58,136 INFO L124 PetriNetUnfolderBase]: 66/1560 cut-off events. [2025-03-14 01:42:58,136 INFO L125 PetriNetUnfolderBase]: For 9/21 co-relation queries the response was YES. [2025-03-14 01:42:58,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1560 events. 66/1560 cut-off events. For 9/21 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8766 event pairs, 6 based on Foata normal form. 1/1444 useless extension candidates. Maximal degree in co-relation 1593. Up to 48 conditions per place. [2025-03-14 01:42:58,148 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-03-14 01:42:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 394 transitions, 912 flow [2025-03-14 01:42:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:58,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:58,151 INFO L175 Difference]: Start difference. First operand has 402 places, 393 transitions, 882 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:58,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 394 transitions, 912 flow [2025-03-14 01:42:58,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 394 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:42:58,156 INFO L231 Difference]: Finished difference. Result has 403 places, 392 transitions, 884 flow [2025-03-14 01:42:58,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=403, PETRI_TRANSITIONS=392} [2025-03-14 01:42:58,157 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -12 predicate places. [2025-03-14 01:42:58,157 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 392 transitions, 884 flow [2025-03-14 01:42:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states 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,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:58,158 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] [2025-03-14 01:42:58,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:42:58,158 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:58,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1131077289, now seen corresponding path program 1 times [2025-03-14 01:42:58,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:58,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954984084] [2025-03-14 01:42:58,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:58,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-14 01:42:58,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-14 01:42:58,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:58,206 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,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954984084] [2025-03-14 01:42:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954984084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:58,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:58,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:58,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032324283] [2025-03-14 01:42:58,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:58,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:58,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:58,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:58,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:58,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 445 [2025-03-14 01:42:58,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 392 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states 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,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:58,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 445 [2025-03-14 01:42:58,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:58,406 INFO L124 PetriNetUnfolderBase]: 74/1231 cut-off events. [2025-03-14 01:42:58,406 INFO L125 PetriNetUnfolderBase]: For 31/37 co-relation queries the response was YES. [2025-03-14 01:42:58,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 1231 events. 74/1231 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6276 event pairs, 14 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 1475. Up to 76 conditions per place. [2025-03-14 01:42:58,418 INFO L140 encePairwiseOnDemand]: 442/445 looper letters, 11 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2025-03-14 01:42:58,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 393 transitions, 914 flow [2025-03-14 01:42:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2025-03-14 01:42:58,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520599250936329 [2025-03-14 01:42:58,422 INFO L175 Difference]: Start difference. First operand has 403 places, 392 transitions, 884 flow. Second operand 3 states and 1271 transitions. [2025-03-14 01:42:58,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 393 transitions, 914 flow [2025-03-14 01:42:58,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 393 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:58,428 INFO L231 Difference]: Finished difference. Result has 402 places, 391 transitions, 882 flow [2025-03-14 01:42:58,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=402, PETRI_TRANSITIONS=391} [2025-03-14 01:42:58,429 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -13 predicate places. [2025-03-14 01:42:58,429 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 391 transitions, 882 flow [2025-03-14 01:42:58,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states 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,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:58,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:42:58,430 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:58,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1634954043, now seen corresponding path program 1 times [2025-03-14 01:42:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016160600] [2025-03-14 01:42:58,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:58,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-14 01:42:58,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-14 01:42:58,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:58,502 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,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016160600] [2025-03-14 01:42:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016160600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514400594] [2025-03-14 01:42:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:58,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:58,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:58,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:58,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2025-03-14 01:42:58,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 391 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:58,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2025-03-14 01:42:58,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:58,692 INFO L124 PetriNetUnfolderBase]: 60/1538 cut-off events. [2025-03-14 01:42:58,692 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2025-03-14 01:42:58,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1818 conditions, 1538 events. 60/1538 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8418 event pairs, 4 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 1589. Up to 50 conditions per place. [2025-03-14 01:42:58,700 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/390 dead transitions. [2025-03-14 01:42:58,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 390 transitions, 898 flow [2025-03-14 01:42:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2025-03-14 01:42:58,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2025-03-14 01:42:58,702 INFO L175 Difference]: Start difference. First operand has 402 places, 391 transitions, 882 flow. Second operand 3 states and 1273 transitions. [2025-03-14 01:42:58,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 390 transitions, 898 flow [2025-03-14 01:42:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 390 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:42:58,706 INFO L231 Difference]: Finished difference. Result has 401 places, 390 transitions, 878 flow [2025-03-14 01:42:58,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=401, PETRI_TRANSITIONS=390} [2025-03-14 01:42:58,707 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-03-14 01:42:58,707 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 390 transitions, 878 flow [2025-03-14 01:42:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:58,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:42:58,708 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:58,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash 868963035, now seen corresponding path program 1 times [2025-03-14 01:42:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:58,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282596098] [2025-03-14 01:42:58,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:58,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-14 01:42:58,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-14 01:42:58,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:58,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:42:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282596098] [2025-03-14 01:42:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282596098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740051386] [2025-03-14 01:42:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:58,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:58,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:58,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:58,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2025-03-14 01:42:58,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 390 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:58,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2025-03-14 01:42:58,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:58,935 INFO L124 PetriNetUnfolderBase]: 56/1511 cut-off events. [2025-03-14 01:42:58,935 INFO L125 PetriNetUnfolderBase]: For 5/11 co-relation queries the response was YES. [2025-03-14 01:42:58,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1511 events. 56/1511 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8223 event pairs, 3 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1698. Up to 48 conditions per place. [2025-03-14 01:42:58,950 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 8 selfloop transitions, 1 changer transitions 0/389 dead transitions. [2025-03-14 01:42:58,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 389 transitions, 894 flow [2025-03-14 01:42:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1273 transitions. [2025-03-14 01:42:58,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535580524344569 [2025-03-14 01:42:58,953 INFO L175 Difference]: Start difference. First operand has 401 places, 390 transitions, 878 flow. Second operand 3 states and 1273 transitions. [2025-03-14 01:42:58,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 389 transitions, 894 flow [2025-03-14 01:42:58,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 389 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:58,957 INFO L231 Difference]: Finished difference. Result has 401 places, 389 transitions, 877 flow [2025-03-14 01:42:58,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=401, PETRI_TRANSITIONS=389} [2025-03-14 01:42:58,958 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-03-14 01:42:58,958 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 389 transitions, 877 flow [2025-03-14 01:42:58,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:42:58,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:42:58,959 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-14 01:42:58,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:42:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1372739785, now seen corresponding path program 1 times [2025-03-14 01:42:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:42:58,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111073126] [2025-03-14 01:42:58,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:42:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:42:58,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-14 01:42:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-14 01:42:58,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:42:58,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:42:59,024 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,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:42:59,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111073126] [2025-03-14 01:42:59,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111073126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:42:59,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:42:59,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:42:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392988322] [2025-03-14 01:42:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:42:59,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:42:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:42:59,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:42:59,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:42:59,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 445 [2025-03-14 01:42:59,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 389 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:42:59,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 445 [2025-03-14 01:42:59,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:42:59,153 INFO L124 PetriNetUnfolderBase]: 52/1170 cut-off events. [2025-03-14 01:42:59,153 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-03-14 01:42:59,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 1170 events. 52/1170 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5809 event pairs, 7 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 1358. Up to 42 conditions per place. [2025-03-14 01:42:59,164 INFO L140 encePairwiseOnDemand]: 443/445 looper letters, 0 selfloop transitions, 0 changer transitions 388/388 dead transitions. [2025-03-14 01:42:59,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 388 transitions, 891 flow [2025-03-14 01:42:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:42:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:42:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2025-03-14 01:42:59,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952808988764045 [2025-03-14 01:42:59,166 INFO L175 Difference]: Start difference. First operand has 401 places, 389 transitions, 877 flow. Second operand 3 states and 1272 transitions. [2025-03-14 01:42:59,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 388 transitions, 891 flow [2025-03-14 01:42:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 388 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:42:59,170 INFO L231 Difference]: Finished difference. Result has 401 places, 0 transitions, 0 flow [2025-03-14 01:42:59,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=445, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=401, PETRI_TRANSITIONS=0} [2025-03-14 01:42:59,171 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -14 predicate places. [2025-03-14 01:42:59,171 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 0 transitions, 0 flow [2025-03-14 01:42:59,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states 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,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2025-03-14 01:42:59,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2025-03-14 01:42:59,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2025-03-14 01:42:59,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2025-03-14 01:42:59,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2025-03-14 01:42:59,174 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2025-03-14 01:42:59,175 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2025-03-14 01:42:59,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2025-03-14 01:42:59,178 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2025-03-14 01:42:59,179 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2025-03-14 01:42:59,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2025-03-14 01:42:59,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:42:59,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:42:59,192 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:42:59,192 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:42:59,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:42:59 BasicIcfg [2025-03-14 01:42:59,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:42:59,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:42:59,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:42:59,200 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:42:59,201 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:52" (3/4) ... [2025-03-14 01:42:59,202 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:42:59,205 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:42:59,205 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:42:59,205 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:42:59,210 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-14 01:42:59,210 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:42:59,210 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:42:59,211 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:42:59,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:42:59,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:42:59,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:42:59,295 INFO L158 Benchmark]: Toolchain (without parser) took 7410.20ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 113.0MB in the beginning and 486.6MB in the end (delta: -373.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:59,295 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:59,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.92ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 100.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:59,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.95ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 98.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:42:59,296 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:59,296 INFO L158 Benchmark]: IcfgBuilder took 571.62ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 68.7MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:42:59,296 INFO L158 Benchmark]: TraceAbstraction took 6461.14ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 68.3MB in the beginning and 490.7MB in the end (delta: -422.4MB). Peak memory consumption was 268.0MB. Max. memory is 16.1GB. [2025-03-14 01:42:59,296 INFO L158 Benchmark]: Witness Printer took 94.19ms. Allocated memory is still 528.5MB. Free memory was 490.7MB in the beginning and 486.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:42:59,297 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.52ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.92ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 100.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.95ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 98.4MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 571.62ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 68.7MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6461.14ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 68.3MB in the beginning and 490.7MB in the end (delta: -422.4MB). Peak memory consumption was 268.0MB. Max. memory is 16.1GB. * Witness Printer took 94.19ms. Allocated memory is still 528.5MB. Free memory was 490.7MB in the beginning and 486.6MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 701 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 462 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 620 IncrementalHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 102 mSDtfsCounter, 620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=20, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3250 NumberOfCodeBlocks, 3250 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:42:59,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE