./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-subst.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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:23:13,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:23:13,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:23:13,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:23:13,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:23:13,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:23:13,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:23:13,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:23:13,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:23:13,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:23:13,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:23:13,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:23:13,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:13,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:23:13,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:23:13,924 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-03-13 22:23:14,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:23:14,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:23:14,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:23:14,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:23:14,171 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:23:14,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-13 22:23:15,409 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e92a398/20de458ca7a344fc9a4b3ae8cc1f3b8d/FLAG9816f9046 [2025-03-13 22:23:15,660 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:23:15,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-13 22:23:15,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e92a398/20de458ca7a344fc9a4b3ae8cc1f3b8d/FLAG9816f9046 [2025-03-13 22:23:15,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88e92a398/20de458ca7a344fc9a4b3ae8cc1f3b8d [2025-03-13 22:23:15,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:23:15,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:23:15,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:15,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:23:15,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:23:15,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:15" (1/1) ... [2025-03-13 22:23:15,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:15, skipping insertion in model container [2025-03-13 22:23:15,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:15" (1/1) ... [2025-03-13 22:23:15,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:23:15,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:15,933 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:23:15,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:16,003 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:23:16,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16 WrapperNode [2025-03-13 22:23:16,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:16,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:16,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:23:16,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:23:16,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,050 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 842 [2025-03-13 22:23:16,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:16,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:23:16,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:23:16,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:23:16,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,083 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:23:16,093 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:23:16,093 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:23:16,093 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:23:16,097 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (1/1) ... [2025-03-13 22:23:16,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:16,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:23:16,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:23:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:23:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:23:16,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:23:16,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:23:16,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:23:16,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:23:16,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:23:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:23:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:23:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:23:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:23:16,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:23:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:23:16,154 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:23:16,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:23:16,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:23:17,069 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:23:17,070 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:23:17,070 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:23:17,110 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:23:17,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:17 BoogieIcfgContainer [2025-03-13 22:23:17,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:23:17,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:23:17,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:23:17,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:23:17,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:23:15" (1/3) ... [2025-03-13 22:23:17,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:17, skipping insertion in model container [2025-03-13 22:23:17,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:16" (2/3) ... [2025-03-13 22:23:17,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54fe50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:17, skipping insertion in model container [2025-03-13 22:23:17,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:17" (3/3) ... [2025-03-13 22:23:17,117 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-03-13 22:23:17,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:23:17,133 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 1055 locations, 1 initial locations, 4 loop locations, and 151 error locations. [2025-03-13 22:23:17,134 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:23:17,300 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:23:17,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1064 places, 1111 transitions, 2243 flow [2025-03-13 22:23:17,705 INFO L124 PetriNetUnfolderBase]: 57/1108 cut-off events. [2025-03-13 22:23:17,708 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:17,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1108 events. 57/1108 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3915 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-13 22:23:17,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 1064 places, 1111 transitions, 2243 flow [2025-03-13 22:23:17,798 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1041 places, 1085 transitions, 2188 flow [2025-03-13 22:23:17,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:23:17,817 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;@61ed365b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:23:17,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 283 error locations. [2025-03-13 22:23:17,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:23:17,822 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 22:23:17,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:23:17,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:17,824 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] [2025-03-13 22:23:17,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:17,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1461848929, now seen corresponding path program 1 times [2025-03-13 22:23:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863682879] [2025-03-13 22:23:17,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:23:17,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:23:17,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:17,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:17,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:17,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863682879] [2025-03-13 22:23:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863682879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104479890] [2025-03-13 22:23:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:17,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:17,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:17,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:18,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:18,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:18,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:18,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:18,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:20,785 INFO L124 PetriNetUnfolderBase]: 612/12182 cut-off events. [2025-03-13 22:23:20,785 INFO L125 PetriNetUnfolderBase]: For 67/85 co-relation queries the response was YES. [2025-03-13 22:23:20,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 12182 events. 612/12182 cut-off events. For 67/85 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 123012 event pairs, 95 based on Foata normal form. 281/9858 useless extension candidates. Maximal degree in co-relation 12186. Up to 185 conditions per place. [2025-03-13 22:23:20,967 INFO L140 encePairwiseOnDemand]: 1091/1111 looper letters, 19 selfloop transitions, 2 changer transitions 2/1067 dead transitions. [2025-03-13 22:23:20,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1067 transitions, 2194 flow [2025-03-13 22:23:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3246 transitions. [2025-03-13 22:23:20,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738973897389739 [2025-03-13 22:23:20,988 INFO L175 Difference]: Start difference. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand 3 states and 3246 transitions. [2025-03-13 22:23:20,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1067 transitions, 2194 flow [2025-03-13 22:23:21,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1067 transitions, 2182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:23:21,013 INFO L231 Difference]: Finished difference. Result has 1036 places, 1065 transitions, 2140 flow [2025-03-13 22:23:21,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=1036, PETRI_TRANSITIONS=1065} [2025-03-13 22:23:21,022 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -5 predicate places. [2025-03-13 22:23:21,022 INFO L471 AbstractCegarLoop]: Abstraction has has 1036 places, 1065 transitions, 2140 flow [2025-03-13 22:23:21,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:21,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:21,025 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] [2025-03-13 22:23:21,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:23:21,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1085946039, now seen corresponding path program 1 times [2025-03-13 22:23:21,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213730119] [2025-03-13 22:23:21,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:21,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 22:23:21,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 22:23:21,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:21,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:21,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213730119] [2025-03-13 22:23:21,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213730119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:21,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:21,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:21,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134890605] [2025-03-13 22:23:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:21,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:21,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:21,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:21,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:21,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:21,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:21,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:21,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:22,052 INFO L124 PetriNetUnfolderBase]: 226/4392 cut-off events. [2025-03-13 22:23:22,052 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-03-13 22:23:22,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 4392 events. 226/4392 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 32959 event pairs, 45 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4480. Up to 110 conditions per place. [2025-03-13 22:23:22,157 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1064 dead transitions. [2025-03-13 22:23:22,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 1064 transitions, 2180 flow [2025-03-13 22:23:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-13 22:23:22,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-13 22:23:22,162 INFO L175 Difference]: Start difference. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand 3 states and 3229 transitions. [2025-03-13 22:23:22,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 1064 transitions, 2180 flow [2025-03-13 22:23:22,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1064 transitions, 2176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:22,174 INFO L231 Difference]: Finished difference. Result has 1033 places, 1064 transitions, 2138 flow [2025-03-13 22:23:22,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1033, PETRI_TRANSITIONS=1064} [2025-03-13 22:23:22,176 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -8 predicate places. [2025-03-13 22:23:22,176 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 1064 transitions, 2138 flow [2025-03-13 22:23:22,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:22,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:22,178 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] [2025-03-13 22:23:22,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:23:22,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -280812172, now seen corresponding path program 1 times [2025-03-13 22:23:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:22,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89094684] [2025-03-13 22:23:22,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:22,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:23:22,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:23:22,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:22,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:22,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:22,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89094684] [2025-03-13 22:23:22,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89094684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:22,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:22,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569672991] [2025-03-13 22:23:22,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:22,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:22,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:22,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:22,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:22,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:22,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:22,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:22,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:22,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:23,230 INFO L124 PetriNetUnfolderBase]: 240/3577 cut-off events. [2025-03-13 22:23:23,230 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-03-13 22:23:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 3577 events. 240/3577 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27386 event pairs, 95 based on Foata normal form. 0/2835 useless extension candidates. Maximal degree in co-relation 3727. Up to 185 conditions per place. [2025-03-13 22:23:23,324 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1063 dead transitions. [2025-03-13 22:23:23,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1063 transitions, 2178 flow [2025-03-13 22:23:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-13 22:23:23,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-13 22:23:23,330 INFO L175 Difference]: Start difference. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand 3 states and 3229 transitions. [2025-03-13 22:23:23,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1063 transitions, 2178 flow [2025-03-13 22:23:23,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:23,348 INFO L231 Difference]: Finished difference. Result has 1032 places, 1063 transitions, 2136 flow [2025-03-13 22:23:23,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=1032, PETRI_TRANSITIONS=1063} [2025-03-13 22:23:23,350 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -9 predicate places. [2025-03-13 22:23:23,350 INFO L471 AbstractCegarLoop]: Abstraction has has 1032 places, 1063 transitions, 2136 flow [2025-03-13 22:23:23,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:23,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:23,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:23:23,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:23,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 283019064, now seen corresponding path program 1 times [2025-03-13 22:23:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714088975] [2025-03-13 22:23:23,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:23,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:23:23,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:23:23,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:23,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714088975] [2025-03-13 22:23:23,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714088975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:23,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:23,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:23,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393562298] [2025-03-13 22:23:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:23,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:23,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:23,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:23,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1111 [2025-03-13 22:23:23,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:23,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:23,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1111 [2025-03-13 22:23:23,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:24,962 INFO L124 PetriNetUnfolderBase]: 245/5502 cut-off events. [2025-03-13 22:23:24,962 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-13 22:23:25,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 5502 events. 245/5502 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 43779 event pairs, 16 based on Foata normal form. 0/4349 useless extension candidates. Maximal degree in co-relation 5521. Up to 51 conditions per place. [2025-03-13 22:23:25,082 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 18 selfloop transitions, 2 changer transitions 0/1062 dead transitions. [2025-03-13 22:23:25,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1062 transitions, 2174 flow [2025-03-13 22:23:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-13 22:23:25,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-13 22:23:25,087 INFO L175 Difference]: Start difference. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand 3 states and 3231 transitions. [2025-03-13 22:23:25,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1062 transitions, 2174 flow [2025-03-13 22:23:25,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1062 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:25,098 INFO L231 Difference]: Finished difference. Result has 1031 places, 1062 transitions, 2134 flow [2025-03-13 22:23:25,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1031, PETRI_TRANSITIONS=1062} [2025-03-13 22:23:25,099 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -10 predicate places. [2025-03-13 22:23:25,100 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1062 transitions, 2134 flow [2025-03-13 22:23:25,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:25,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:25,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:25,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:23:25,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:25,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1183440073, now seen corresponding path program 1 times [2025-03-13 22:23:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080670025] [2025-03-13 22:23:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:25,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:23:25,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:23:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:25,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:25,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080670025] [2025-03-13 22:23:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080670025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003389960] [2025-03-13 22:23:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:25,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:25,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:25,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:25,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-13 22:23:25,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:25,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:25,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-13 22:23:25,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:25,506 INFO L124 PetriNetUnfolderBase]: 73/1611 cut-off events. [2025-03-13 22:23:25,506 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:23:25,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1611 events. 73/1611 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8250 event pairs, 12 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1607. Up to 40 conditions per place. [2025-03-13 22:23:25,555 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1061 dead transitions. [2025-03-13 22:23:25,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1061 transitions, 2166 flow [2025-03-13 22:23:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-13 22:23:25,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-13 22:23:25,559 INFO L175 Difference]: Start difference. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand 3 states and 3237 transitions. [2025-03-13 22:23:25,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 1061 transitions, 2166 flow [2025-03-13 22:23:25,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 1061 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:25,571 INFO L231 Difference]: Finished difference. Result has 1030 places, 1061 transitions, 2132 flow [2025-03-13 22:23:25,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1030, PETRI_TRANSITIONS=1061} [2025-03-13 22:23:25,573 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -11 predicate places. [2025-03-13 22:23:25,573 INFO L471 AbstractCegarLoop]: Abstraction has has 1030 places, 1061 transitions, 2132 flow [2025-03-13 22:23:25,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:25,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:25,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:25,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:23:25,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:25,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1347377122, now seen corresponding path program 1 times [2025-03-13 22:23:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909258704] [2025-03-13 22:23:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:25,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:23:25,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:23:25,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:25,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909258704] [2025-03-13 22:23:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909258704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613883405] [2025-03-13 22:23:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:25,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:25,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:25,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-13 22:23:25,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:25,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:25,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-13 22:23:25,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:26,435 INFO L124 PetriNetUnfolderBase]: 167/3835 cut-off events. [2025-03-13 22:23:26,435 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-03-13 22:23:26,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 3835 events. 167/3835 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26097 event pairs, 10 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 3816. Up to 35 conditions per place. [2025-03-13 22:23:26,538 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2025-03-13 22:23:26,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 1060 transitions, 2162 flow [2025-03-13 22:23:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-13 22:23:26,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-13 22:23:26,542 INFO L175 Difference]: Start difference. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand 3 states and 3239 transitions. [2025-03-13 22:23:26,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 1060 transitions, 2162 flow [2025-03-13 22:23:26,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1060 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:26,552 INFO L231 Difference]: Finished difference. Result has 1029 places, 1060 transitions, 2130 flow [2025-03-13 22:23:26,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1029, PETRI_TRANSITIONS=1060} [2025-03-13 22:23:26,554 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -12 predicate places. [2025-03-13 22:23:26,554 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1060 transitions, 2130 flow [2025-03-13 22:23:26,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:26,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:26,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:23:26,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash -340197636, now seen corresponding path program 1 times [2025-03-13 22:23:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:26,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-03-13 22:23:26,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:26,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:23:26,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:23:26,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:26,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:26,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-03-13 22:23:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391911339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:26,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:26,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586580666] [2025-03-13 22:23:26,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:26,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:26,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:26,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:26,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-13 22:23:26,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:26,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-13 22:23:26,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:28,378 INFO L124 PetriNetUnfolderBase]: 349/7719 cut-off events. [2025-03-13 22:23:28,378 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-13 22:23:28,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 7719 events. 349/7719 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 68364 event pairs, 24 based on Foata normal form. 0/6095 useless extension candidates. Maximal degree in co-relation 7741. Up to 70 conditions per place. [2025-03-13 22:23:28,588 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2025-03-13 22:23:28,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1059 transitions, 2174 flow [2025-03-13 22:23:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-13 22:23:28,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-13 22:23:28,592 INFO L175 Difference]: Start difference. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand 3 states and 3225 transitions. [2025-03-13 22:23:28,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1059 transitions, 2174 flow [2025-03-13 22:23:28,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1059 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:28,602 INFO L231 Difference]: Finished difference. Result has 1028 places, 1059 transitions, 2128 flow [2025-03-13 22:23:28,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1028, PETRI_TRANSITIONS=1059} [2025-03-13 22:23:28,604 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -13 predicate places. [2025-03-13 22:23:28,604 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1059 transitions, 2128 flow [2025-03-13 22:23:28,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:28,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:28,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:28,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:23:28,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:28,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:28,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1927814138, now seen corresponding path program 1 times [2025-03-13 22:23:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:28,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23125175] [2025-03-13 22:23:28,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:28,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-13 22:23:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-13 22:23:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:28,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:28,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23125175] [2025-03-13 22:23:28,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23125175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:28,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:28,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:28,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619608081] [2025-03-13 22:23:28,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:28,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:28,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:28,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:28,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:28,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:28,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:29,651 INFO L124 PetriNetUnfolderBase]: 149/3282 cut-off events. [2025-03-13 22:23:29,652 INFO L125 PetriNetUnfolderBase]: For 9/33 co-relation queries the response was YES. [2025-03-13 22:23:29,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 3282 events. 149/3282 cut-off events. For 9/33 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 21580 event pairs, 16 based on Foata normal form. 0/2610 useless extension candidates. Maximal degree in co-relation 3262. Up to 52 conditions per place. [2025-03-13 22:23:29,791 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2025-03-13 22:23:29,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1058 transitions, 2168 flow [2025-03-13 22:23:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-13 22:23:29,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-13 22:23:29,796 INFO L175 Difference]: Start difference. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand 3 states and 3229 transitions. [2025-03-13 22:23:29,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1058 transitions, 2168 flow [2025-03-13 22:23:29,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1058 transitions, 2164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:29,809 INFO L231 Difference]: Finished difference. Result has 1027 places, 1058 transitions, 2126 flow [2025-03-13 22:23:29,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1027, PETRI_TRANSITIONS=1058} [2025-03-13 22:23:29,811 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -14 predicate places. [2025-03-13 22:23:29,811 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1058 transitions, 2126 flow [2025-03-13 22:23:29,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:29,813 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] [2025-03-13 22:23:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:29,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:29,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 663153792, now seen corresponding path program 1 times [2025-03-13 22:23:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014452485] [2025-03-13 22:23:29,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:29,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-13 22:23:29,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-13 22:23:29,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:29,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:29,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014452485] [2025-03-13 22:23:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014452485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68840863] [2025-03-13 22:23:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:29,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:29,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:29,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:29,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-13 22:23:29,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:29,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-13 22:23:29,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:30,373 INFO L124 PetriNetUnfolderBase]: 73/1607 cut-off events. [2025-03-13 22:23:30,373 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-03-13 22:23:30,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1607 events. 73/1607 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7799 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1565. Up to 40 conditions per place. [2025-03-13 22:23:30,440 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2025-03-13 22:23:30,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1057 transitions, 2158 flow [2025-03-13 22:23:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-13 22:23:30,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-13 22:23:30,445 INFO L175 Difference]: Start difference. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand 3 states and 3237 transitions. [2025-03-13 22:23:30,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1057 transitions, 2158 flow [2025-03-13 22:23:30,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:30,459 INFO L231 Difference]: Finished difference. Result has 1026 places, 1057 transitions, 2124 flow [2025-03-13 22:23:30,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1026, PETRI_TRANSITIONS=1057} [2025-03-13 22:23:30,461 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -15 predicate places. [2025-03-13 22:23:30,461 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1057 transitions, 2124 flow [2025-03-13 22:23:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:30,462 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] [2025-03-13 22:23:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:23:30,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 350800420, now seen corresponding path program 1 times [2025-03-13 22:23:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467266320] [2025-03-13 22:23:30,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:30,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:30,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:23:30,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:23:30,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:30,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467266320] [2025-03-13 22:23:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467266320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712265226] [2025-03-13 22:23:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:30,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:30,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:30,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-13 22:23:30,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:30,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-13 22:23:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:31,086 INFO L124 PetriNetUnfolderBase]: 107/2446 cut-off events. [2025-03-13 22:23:31,087 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-13 22:23:31,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 2446 events. 107/2446 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13612 event pairs, 10 based on Foata normal form. 0/1958 useless extension candidates. Maximal degree in co-relation 2390. Up to 35 conditions per place. [2025-03-13 22:23:31,252 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2025-03-13 22:23:31,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1056 transitions, 2154 flow [2025-03-13 22:23:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-13 22:23:31,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-13 22:23:31,256 INFO L175 Difference]: Start difference. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand 3 states and 3239 transitions. [2025-03-13 22:23:31,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1056 transitions, 2154 flow [2025-03-13 22:23:31,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:31,265 INFO L231 Difference]: Finished difference. Result has 1025 places, 1056 transitions, 2122 flow [2025-03-13 22:23:31,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1025, PETRI_TRANSITIONS=1056} [2025-03-13 22:23:31,267 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -16 predicate places. [2025-03-13 22:23:31,267 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1056 transitions, 2122 flow [2025-03-13 22:23:31,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:31,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:31,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:23:31,269 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:31,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:31,270 INFO L85 PathProgramCache]: Analyzing trace with hash 941585482, now seen corresponding path program 1 times [2025-03-13 22:23:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:31,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865467876] [2025-03-13 22:23:31,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:31,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:31,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:23:31,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:23:31,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:31,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:31,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865467876] [2025-03-13 22:23:31,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865467876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:31,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:31,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:31,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595837325] [2025-03-13 22:23:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:31,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:31,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:31,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:31,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-13 22:23:31,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:31,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-13 22:23:31,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:32,435 INFO L124 PetriNetUnfolderBase]: 205/4391 cut-off events. [2025-03-13 22:23:32,435 INFO L125 PetriNetUnfolderBase]: For 13/111 co-relation queries the response was YES. [2025-03-13 22:23:32,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4391 events. 205/4391 cut-off events. For 13/111 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 32378 event pairs, 24 based on Foata normal form. 0/3479 useless extension candidates. Maximal degree in co-relation 4369. Up to 70 conditions per place. [2025-03-13 22:23:32,638 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2025-03-13 22:23:32,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1055 transitions, 2166 flow [2025-03-13 22:23:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-13 22:23:32,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-13 22:23:32,643 INFO L175 Difference]: Start difference. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand 3 states and 3225 transitions. [2025-03-13 22:23:32,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1055 transitions, 2166 flow [2025-03-13 22:23:32,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:32,654 INFO L231 Difference]: Finished difference. Result has 1024 places, 1055 transitions, 2120 flow [2025-03-13 22:23:32,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1024, PETRI_TRANSITIONS=1055} [2025-03-13 22:23:32,656 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -17 predicate places. [2025-03-13 22:23:32,656 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1055 transitions, 2120 flow [2025-03-13 22:23:32,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:32,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:32,658 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] [2025-03-13 22:23:32,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:23:32,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:32,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1304688186, now seen corresponding path program 1 times [2025-03-13 22:23:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824996923] [2025-03-13 22:23:32,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:32,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:32,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-13 22:23:32,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-13 22:23:32,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:32,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:32,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:32,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824996923] [2025-03-13 22:23:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824996923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:32,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172021118] [2025-03-13 22:23:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:32,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:32,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:32,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:32,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:32,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:32,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:32,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:32,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:33,005 INFO L124 PetriNetUnfolderBase]: 77/1572 cut-off events. [2025-03-13 22:23:33,006 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-03-13 22:23:33,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1572 events. 77/1572 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7444 event pairs, 16 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1514. Up to 54 conditions per place. [2025-03-13 22:23:33,049 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2025-03-13 22:23:33,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1054 transitions, 2160 flow [2025-03-13 22:23:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-13 22:23:33,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-13 22:23:33,057 INFO L175 Difference]: Start difference. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand 3 states and 3229 transitions. [2025-03-13 22:23:33,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1054 transitions, 2160 flow [2025-03-13 22:23:33,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1054 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:33,069 INFO L231 Difference]: Finished difference. Result has 1023 places, 1054 transitions, 2118 flow [2025-03-13 22:23:33,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1023, PETRI_TRANSITIONS=1054} [2025-03-13 22:23:33,070 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -18 predicate places. [2025-03-13 22:23:33,070 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1054 transitions, 2118 flow [2025-03-13 22:23:33,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:33,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:33,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:23:33,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:33,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:33,072 INFO L85 PathProgramCache]: Analyzing trace with hash 212472221, now seen corresponding path program 1 times [2025-03-13 22:23:33,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:33,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194276827] [2025-03-13 22:23:33,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:33,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-13 22:23:33,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-13 22:23:33,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:33,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:33,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:33,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194276827] [2025-03-13 22:23:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194276827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:33,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474195722] [2025-03-13 22:23:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:33,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:33,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-13 22:23:33,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:33,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-13 22:23:33,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:33,432 INFO L124 PetriNetUnfolderBase]: 73/1603 cut-off events. [2025-03-13 22:23:33,432 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-13 22:23:33,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1603 events. 73/1603 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7304 event pairs, 12 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1523. Up to 40 conditions per place. [2025-03-13 22:23:33,479 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2025-03-13 22:23:33,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1053 transitions, 2150 flow [2025-03-13 22:23:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-13 22:23:33,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-13 22:23:33,483 INFO L175 Difference]: Start difference. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand 3 states and 3237 transitions. [2025-03-13 22:23:33,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1053 transitions, 2150 flow [2025-03-13 22:23:33,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:33,493 INFO L231 Difference]: Finished difference. Result has 1022 places, 1053 transitions, 2116 flow [2025-03-13 22:23:33,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1022, PETRI_TRANSITIONS=1053} [2025-03-13 22:23:33,494 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -19 predicate places. [2025-03-13 22:23:33,494 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1053 transitions, 2116 flow [2025-03-13 22:23:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:33,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:33,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:23:33,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:33,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1280709980, now seen corresponding path program 1 times [2025-03-13 22:23:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:33,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-03-13 22:23:33,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:33,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-13 22:23:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-13 22:23:33,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:33,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970521899] [2025-03-13 22:23:33,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970521899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:33,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:33,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:33,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622609330] [2025-03-13 22:23:33,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:33,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:33,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:33,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:33,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:33,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-13 22:23:33,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:33,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-13 22:23:33,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:33,759 INFO L124 PetriNetUnfolderBase]: 47/1072 cut-off events. [2025-03-13 22:23:33,759 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-13 22:23:33,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1072 events. 47/1072 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4390 event pairs, 10 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 979. Up to 35 conditions per place. [2025-03-13 22:23:33,797 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2025-03-13 22:23:33,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1052 transitions, 2146 flow [2025-03-13 22:23:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-13 22:23:33,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-13 22:23:33,801 INFO L175 Difference]: Start difference. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand 3 states and 3239 transitions. [2025-03-13 22:23:33,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1052 transitions, 2146 flow [2025-03-13 22:23:33,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:33,813 INFO L231 Difference]: Finished difference. Result has 1021 places, 1052 transitions, 2114 flow [2025-03-13 22:23:33,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1052} [2025-03-13 22:23:33,815 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-03-13 22:23:33,815 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1052 transitions, 2114 flow [2025-03-13 22:23:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:33,816 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] [2025-03-13 22:23:33,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:23:33,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:33,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1228748222, now seen corresponding path program 1 times [2025-03-13 22:23:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:33,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663705047] [2025-03-13 22:23:33,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:33,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-13 22:23:33,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-13 22:23:33,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:33,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663705047] [2025-03-13 22:23:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663705047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:33,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:33,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530769490] [2025-03-13 22:23:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:33,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:33,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:33,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:33,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-13 22:23:33,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:33,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-13 22:23:33,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:34,188 INFO L124 PetriNetUnfolderBase]: 85/1601 cut-off events. [2025-03-13 22:23:34,188 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-13 22:23:34,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1601 events. 85/1601 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8320 event pairs, 24 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1535. Up to 70 conditions per place. [2025-03-13 22:23:34,234 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2025-03-13 22:23:34,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1051 transitions, 2158 flow [2025-03-13 22:23:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-13 22:23:34,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-13 22:23:34,238 INFO L175 Difference]: Start difference. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand 3 states and 3225 transitions. [2025-03-13 22:23:34,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1051 transitions, 2158 flow [2025-03-13 22:23:34,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:34,253 INFO L231 Difference]: Finished difference. Result has 1020 places, 1051 transitions, 2112 flow [2025-03-13 22:23:34,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1020, PETRI_TRANSITIONS=1051} [2025-03-13 22:23:34,255 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -21 predicate places. [2025-03-13 22:23:34,255 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1051 transitions, 2112 flow [2025-03-13 22:23:34,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:34,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:34,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:34,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:23:34,256 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2012202686, now seen corresponding path program 1 times [2025-03-13 22:23:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830943318] [2025-03-13 22:23:34,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:34,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:23:34,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:23:34,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:34,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:34,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830943318] [2025-03-13 22:23:34,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830943318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:34,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:34,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:34,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799816381] [2025-03-13 22:23:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:34,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:34,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:34,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:34,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-03-13 22:23:34,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:34,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:34,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-03-13 22:23:34,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:34,868 INFO L124 PetriNetUnfolderBase]: 121/2611 cut-off events. [2025-03-13 22:23:34,868 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-13 22:23:34,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 2611 events. 121/2611 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14369 event pairs, 15 based on Foata normal form. 0/2092 useless extension candidates. Maximal degree in co-relation 2514. Up to 43 conditions per place. [2025-03-13 22:23:34,955 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 12 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-13 22:23:34,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1050 transitions, 2138 flow [2025-03-13 22:23:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:34,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3243 transitions. [2025-03-13 22:23:34,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972997299729973 [2025-03-13 22:23:34,959 INFO L175 Difference]: Start difference. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand 3 states and 3243 transitions. [2025-03-13 22:23:34,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1050 transitions, 2138 flow [2025-03-13 22:23:34,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1050 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:34,970 INFO L231 Difference]: Finished difference. Result has 1019 places, 1050 transitions, 2110 flow [2025-03-13 22:23:34,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1019, PETRI_TRANSITIONS=1050} [2025-03-13 22:23:34,971 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -22 predicate places. [2025-03-13 22:23:34,972 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1050 transitions, 2110 flow [2025-03-13 22:23:34,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:34,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:34,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:34,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:23:34,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:34,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1623007537, now seen corresponding path program 1 times [2025-03-13 22:23:34,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:34,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921958149] [2025-03-13 22:23:34,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:34,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:34,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-13 22:23:35,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-13 22:23:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921958149] [2025-03-13 22:23:35,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921958149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:35,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:35,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:35,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92905914] [2025-03-13 22:23:35,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:35,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:35,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:35,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:35,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:35,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1111 [2025-03-13 22:23:35,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:35,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:35,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1111 [2025-03-13 22:23:35,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:38,448 INFO L124 PetriNetUnfolderBase]: 893/12790 cut-off events. [2025-03-13 22:23:38,448 INFO L125 PetriNetUnfolderBase]: For 59/69 co-relation queries the response was YES. [2025-03-13 22:23:38,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13410 conditions, 12790 events. 893/12790 cut-off events. For 59/69 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 131974 event pairs, 264 based on Foata normal form. 0/10061 useless extension candidates. Maximal degree in co-relation 13198. Up to 580 conditions per place. [2025-03-13 22:23:38,650 INFO L140 encePairwiseOnDemand]: 1105/1111 looper letters, 26 selfloop transitions, 5 changer transitions 0/1049 dead transitions. [2025-03-13 22:23:38,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1049 transitions, 2170 flow [2025-03-13 22:23:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6392 transitions. [2025-03-13 22:23:38,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9588958895889589 [2025-03-13 22:23:38,656 INFO L175 Difference]: Start difference. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand 6 states and 6392 transitions. [2025-03-13 22:23:38,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1049 transitions, 2170 flow [2025-03-13 22:23:38,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1049 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:38,664 INFO L231 Difference]: Finished difference. Result has 1021 places, 1049 transitions, 2114 flow [2025-03-13 22:23:38,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1049} [2025-03-13 22:23:38,665 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-03-13 22:23:38,665 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1049 transitions, 2114 flow [2025-03-13 22:23:38,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:38,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:38,666 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] [2025-03-13 22:23:38,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:23:38,666 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:38,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1997322370, now seen corresponding path program 1 times [2025-03-13 22:23:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-03-13 22:23:38,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:38,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:23:38,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:23:38,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:38,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:38,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63283295] [2025-03-13 22:23:38,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63283295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:38,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:38,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:38,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595634739] [2025-03-13 22:23:38,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:38,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:38,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-13 22:23:38,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:38,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:38,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-13 22:23:38,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:39,506 INFO L124 PetriNetUnfolderBase]: 163/3539 cut-off events. [2025-03-13 22:23:39,506 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-13 22:23:39,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 3539 events. 163/3539 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22864 event pairs, 9 based on Foata normal form. 0/2821 useless extension candidates. Maximal degree in co-relation 3602. Up to 43 conditions per place. [2025-03-13 22:23:39,640 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-13 22:23:39,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1050 transitions, 2154 flow [2025-03-13 22:23:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-13 22:23:39,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-13 22:23:39,647 INFO L175 Difference]: Start difference. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand 3 states and 3244 transitions. [2025-03-13 22:23:39,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1050 transitions, 2154 flow [2025-03-13 22:23:39,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1050 transitions, 2144 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:39,656 INFO L231 Difference]: Finished difference. Result has 1017 places, 1048 transitions, 2106 flow [2025-03-13 22:23:39,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1017, PETRI_TRANSITIONS=1048} [2025-03-13 22:23:39,657 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -24 predicate places. [2025-03-13 22:23:39,657 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1048 transitions, 2106 flow [2025-03-13 22:23:39,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:39,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:39,658 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] [2025-03-13 22:23:39,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:23:39,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:39,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1828985127, now seen corresponding path program 1 times [2025-03-13 22:23:39,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:39,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379068081] [2025-03-13 22:23:39,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:39,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:39,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-13 22:23:39,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-13 22:23:39,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:39,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379068081] [2025-03-13 22:23:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379068081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:39,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:39,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516031246] [2025-03-13 22:23:39,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:39,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:39,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:39,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:39,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:39,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:39,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:39,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:39,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:40,191 INFO L124 PetriNetUnfolderBase]: 115/2154 cut-off events. [2025-03-13 22:23:40,191 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:23:40,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 2154 events. 115/2154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 13223 event pairs, 26 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 2062. Up to 73 conditions per place. [2025-03-13 22:23:40,247 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-03-13 22:23:40,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1049 transitions, 2158 flow [2025-03-13 22:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-13 22:23:40,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-13 22:23:40,249 INFO L175 Difference]: Start difference. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand 3 states and 3232 transitions. [2025-03-13 22:23:40,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1049 transitions, 2158 flow [2025-03-13 22:23:40,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1049 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:40,258 INFO L231 Difference]: Finished difference. Result has 1016 places, 1047 transitions, 2104 flow [2025-03-13 22:23:40,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1016, PETRI_TRANSITIONS=1047} [2025-03-13 22:23:40,260 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -25 predicate places. [2025-03-13 22:23:40,260 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1047 transitions, 2104 flow [2025-03-13 22:23:40,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:40,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:40,261 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] [2025-03-13 22:23:40,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:23:40,261 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:40,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1115919417, now seen corresponding path program 1 times [2025-03-13 22:23:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:40,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120696154] [2025-03-13 22:23:40,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:40,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-13 22:23:40,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-13 22:23:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120696154] [2025-03-13 22:23:40,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120696154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:40,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679513963] [2025-03-13 22:23:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:40,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:40,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:40,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:40,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-13 22:23:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:40,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-13 22:23:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:40,675 INFO L124 PetriNetUnfolderBase]: 79/1602 cut-off events. [2025-03-13 22:23:40,675 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2025-03-13 22:23:40,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 1602 events. 79/1602 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7898 event pairs, 14 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 1454. Up to 43 conditions per place. [2025-03-13 22:23:40,734 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-03-13 22:23:40,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1048 transitions, 2144 flow [2025-03-13 22:23:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-13 22:23:40,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-13 22:23:40,737 INFO L175 Difference]: Start difference. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand 3 states and 3244 transitions. [2025-03-13 22:23:40,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1048 transitions, 2144 flow [2025-03-13 22:23:40,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1048 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:40,746 INFO L231 Difference]: Finished difference. Result has 1015 places, 1046 transitions, 2102 flow [2025-03-13 22:23:40,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1015, PETRI_TRANSITIONS=1046} [2025-03-13 22:23:40,747 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -26 predicate places. [2025-03-13 22:23:40,747 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1046 transitions, 2102 flow [2025-03-13 22:23:40,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:40,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:40,748 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] [2025-03-13 22:23:40,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:23:40,748 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1338613789, now seen corresponding path program 1 times [2025-03-13 22:23:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:40,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173102810] [2025-03-13 22:23:40,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:40,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-13 22:23:40,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-13 22:23:40,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:40,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:40,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:40,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173102810] [2025-03-13 22:23:40,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173102810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:40,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:40,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5560603] [2025-03-13 22:23:40,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:40,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:40,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:40,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:40,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-13 22:23:40,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:40,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:40,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-13 22:23:40,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:42,934 INFO L124 PetriNetUnfolderBase]: 847/10614 cut-off events. [2025-03-13 22:23:42,934 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-13 22:23:43,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11414 conditions, 10614 events. 847/10614 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 103437 event pairs, 190 based on Foata normal form. 0/8479 useless extension candidates. Maximal degree in co-relation 10900. Up to 658 conditions per place. [2025-03-13 22:23:43,163 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2025-03-13 22:23:43,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1040 transitions, 2154 flow [2025-03-13 22:23:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-13 22:23:43,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-13 22:23:43,165 INFO L175 Difference]: Start difference. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand 3 states and 3206 transitions. [2025-03-13 22:23:43,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1040 transitions, 2154 flow [2025-03-13 22:23:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1040 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:43,175 INFO L231 Difference]: Finished difference. Result has 1006 places, 1038 transitions, 2092 flow [2025-03-13 22:23:43,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1006, PETRI_TRANSITIONS=1038} [2025-03-13 22:23:43,176 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -35 predicate places. [2025-03-13 22:23:43,176 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1038 transitions, 2092 flow [2025-03-13 22:23:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:43,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:43,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:43,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:23:43,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:43,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:43,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2082408196, now seen corresponding path program 1 times [2025-03-13 22:23:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:43,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861454323] [2025-03-13 22:23:43,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:43,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-13 22:23:43,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-13 22:23:43,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:43,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:43,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861454323] [2025-03-13 22:23:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861454323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240490926] [2025-03-13 22:23:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:43,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:43,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:43,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:43,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:43,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-13 22:23:43,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:43,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:43,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-13 22:23:43,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:45,080 INFO L124 PetriNetUnfolderBase]: 451/6342 cut-off events. [2025-03-13 22:23:45,080 INFO L125 PetriNetUnfolderBase]: For 31/77 co-relation queries the response was YES. [2025-03-13 22:23:45,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 6342 events. 451/6342 cut-off events. For 31/77 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 51722 event pairs, 110 based on Foata normal form. 1/5113 useless extension candidates. Maximal degree in co-relation 6242. Up to 340 conditions per place. [2025-03-13 22:23:45,304 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1032 dead transitions. [2025-03-13 22:23:45,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 1032 transitions, 2144 flow [2025-03-13 22:23:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-13 22:23:45,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-13 22:23:45,305 INFO L175 Difference]: Start difference. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand 3 states and 3206 transitions. [2025-03-13 22:23:45,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 1032 transitions, 2144 flow [2025-03-13 22:23:45,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1032 transitions, 2144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:45,314 INFO L231 Difference]: Finished difference. Result has 999 places, 1030 transitions, 2086 flow [2025-03-13 22:23:45,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1030} [2025-03-13 22:23:45,316 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-03-13 22:23:45,316 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1030 transitions, 2086 flow [2025-03-13 22:23:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:45,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:45,317 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] [2025-03-13 22:23:45,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:23:45,317 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:45,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1385620179, now seen corresponding path program 1 times [2025-03-13 22:23:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650219963] [2025-03-13 22:23:45,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:45,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-13 22:23:45,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-13 22:23:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650219963] [2025-03-13 22:23:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650219963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438878372] [2025-03-13 22:23:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:45,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:45,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:45,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:45,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:45,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1030 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:45,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:45,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:45,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:45,951 INFO L124 PetriNetUnfolderBase]: 166/2871 cut-off events. [2025-03-13 22:23:45,951 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-03-13 22:23:46,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 2871 events. 166/2871 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20431 event pairs, 37 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 2250. Up to 106 conditions per place. [2025-03-13 22:23:46,058 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2025-03-13 22:23:46,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1031 transitions, 2138 flow [2025-03-13 22:23:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-13 22:23:46,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-13 22:23:46,060 INFO L175 Difference]: Start difference. First operand has 999 places, 1030 transitions, 2086 flow. Second operand 3 states and 3232 transitions. [2025-03-13 22:23:46,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1031 transitions, 2138 flow [2025-03-13 22:23:46,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1031 transitions, 2138 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:46,070 INFO L231 Difference]: Finished difference. Result has 1000 places, 1029 transitions, 2088 flow [2025-03-13 22:23:46,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1000, PETRI_TRANSITIONS=1029} [2025-03-13 22:23:46,071 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -41 predicate places. [2025-03-13 22:23:46,071 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1029 transitions, 2088 flow [2025-03-13 22:23:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:46,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:46,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:23:46,072 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:46,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 626883669, now seen corresponding path program 1 times [2025-03-13 22:23:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667157924] [2025-03-13 22:23:46,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-13 22:23:46,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-13 22:23:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667157924] [2025-03-13 22:23:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667157924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328417688] [2025-03-13 22:23:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-13 22:23:46,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:46,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-13 22:23:46,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:46,540 INFO L124 PetriNetUnfolderBase]: 105/2080 cut-off events. [2025-03-13 22:23:46,540 INFO L125 PetriNetUnfolderBase]: For 21/35 co-relation queries the response was YES. [2025-03-13 22:23:46,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 2080 events. 105/2080 cut-off events. For 21/35 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11734 event pairs, 14 based on Foata normal form. 1/1710 useless extension candidates. Maximal degree in co-relation 1934. Up to 48 conditions per place. [2025-03-13 22:23:46,638 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2025-03-13 22:23:46,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1030 transitions, 2128 flow [2025-03-13 22:23:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-13 22:23:46,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-13 22:23:46,640 INFO L175 Difference]: Start difference. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand 3 states and 3244 transitions. [2025-03-13 22:23:46,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1030 transitions, 2128 flow [2025-03-13 22:23:46,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1030 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:46,648 INFO L231 Difference]: Finished difference. Result has 999 places, 1028 transitions, 2086 flow [2025-03-13 22:23:46,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1028} [2025-03-13 22:23:46,649 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-03-13 22:23:46,649 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1028 transitions, 2086 flow [2025-03-13 22:23:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:46,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:46,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:46,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:23:46,649 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:46,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 517139201, now seen corresponding path program 1 times [2025-03-13 22:23:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030585542] [2025-03-13 22:23:46,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-13 22:23:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-13 22:23:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030585542] [2025-03-13 22:23:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030585542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347886169] [2025-03-13 22:23:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:46,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:46,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:46,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:46,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1111 [2025-03-13 22:23:46,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1028 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:46,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:46,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1111 [2025-03-13 22:23:46,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,448 INFO L124 PetriNetUnfolderBase]: 191/3773 cut-off events. [2025-03-13 22:23:47,449 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-13 22:23:47,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 3773 events. 191/3773 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25720 event pairs, 8 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 3438. Up to 42 conditions per place. [2025-03-13 22:23:47,578 INFO L140 encePairwiseOnDemand]: 1097/1111 looper letters, 18 selfloop transitions, 9 changer transitions 0/1029 dead transitions. [2025-03-13 22:23:47,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1029 transitions, 2144 flow [2025-03-13 22:23:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3230 transitions. [2025-03-13 22:23:47,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690969096909691 [2025-03-13 22:23:47,580 INFO L175 Difference]: Start difference. First operand has 999 places, 1028 transitions, 2086 flow. Second operand 3 states and 3230 transitions. [2025-03-13 22:23:47,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1029 transitions, 2144 flow [2025-03-13 22:23:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1029 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:47,588 INFO L231 Difference]: Finished difference. Result has 995 places, 1027 transitions, 2115 flow [2025-03-13 22:23:47,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=995, PETRI_TRANSITIONS=1027} [2025-03-13 22:23:47,590 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2025-03-13 22:23:47,590 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1027 transitions, 2115 flow [2025-03-13 22:23:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:47,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:23:47,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:47,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2005271327, now seen corresponding path program 1 times [2025-03-13 22:23:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-03-13 22:23:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-13 22:23:47,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-13 22:23:47,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-03-13 22:23:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595382007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307550233] [2025-03-13 22:23:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-13 22:23:47,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1027 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:47,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-13 22:23:47,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:51,268 INFO L124 PetriNetUnfolderBase]: 1560/19947 cut-off events. [2025-03-13 22:23:51,268 INFO L125 PetriNetUnfolderBase]: For 147/153 co-relation queries the response was YES. [2025-03-13 22:23:51,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21185 conditions, 19947 events. 1560/19947 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 223057 event pairs, 488 based on Foata normal form. 0/16098 useless extension candidates. Maximal degree in co-relation 15917. Up to 1175 conditions per place. [2025-03-13 22:23:51,612 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1021 dead transitions. [2025-03-13 22:23:51,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1021 transitions, 2167 flow [2025-03-13 22:23:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-13 22:23:51,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-13 22:23:51,614 INFO L175 Difference]: Start difference. First operand has 995 places, 1027 transitions, 2115 flow. Second operand 3 states and 3206 transitions. [2025-03-13 22:23:51,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1021 transitions, 2167 flow [2025-03-13 22:23:51,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1021 transitions, 2158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:51,628 INFO L231 Difference]: Finished difference. Result has 987 places, 1019 transitions, 2100 flow [2025-03-13 22:23:51,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1019} [2025-03-13 22:23:51,629 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-03-13 22:23:51,629 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1019 transitions, 2100 flow [2025-03-13 22:23:51,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:51,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:51,630 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] [2025-03-13 22:23:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:23:51,630 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:51,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash 18865322, now seen corresponding path program 1 times [2025-03-13 22:23:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:51,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408536946] [2025-03-13 22:23:51,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-13 22:23:51,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-13 22:23:51,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:51,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408536946] [2025-03-13 22:23:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408536946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012129898] [2025-03-13 22:23:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:51,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:51,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:51,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:51,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1111 [2025-03-13 22:23:51,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1019 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:51,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:51,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1111 [2025-03-13 22:23:51,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:52,602 INFO L124 PetriNetUnfolderBase]: 261/5106 cut-off events. [2025-03-13 22:23:52,603 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2025-03-13 22:23:52,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 5106 events. 261/5106 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 44421 event pairs, 20 based on Foata normal form. 1/4217 useless extension candidates. Maximal degree in co-relation 4580. Up to 68 conditions per place. [2025-03-13 22:23:52,720 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 3 changer transitions 0/1020 dead transitions. [2025-03-13 22:23:52,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 1020 transitions, 2154 flow [2025-03-13 22:23:52,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3238 transitions. [2025-03-13 22:23:52,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714971497149715 [2025-03-13 22:23:52,722 INFO L175 Difference]: Start difference. First operand has 987 places, 1019 transitions, 2100 flow. Second operand 3 states and 3238 transitions. [2025-03-13 22:23:52,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 1020 transitions, 2154 flow [2025-03-13 22:23:52,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 1020 transitions, 2154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:23:52,730 INFO L231 Difference]: Finished difference. Result has 988 places, 1018 transitions, 2104 flow [2025-03-13 22:23:52,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=988, PETRI_TRANSITIONS=1018} [2025-03-13 22:23:52,731 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -53 predicate places. [2025-03-13 22:23:52,731 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 1018 transitions, 2104 flow [2025-03-13 22:23:52,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:52,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:52,732 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] [2025-03-13 22:23:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:23:52,732 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1932998668, now seen corresponding path program 1 times [2025-03-13 22:23:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288596693] [2025-03-13 22:23:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:52,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-13 22:23:52,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-13 22:23:52,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:52,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288596693] [2025-03-13 22:23:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288596693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215516004] [2025-03-13 22:23:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:52,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:52,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:52,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:52,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:23:52,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:52,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:52,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:23:52,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:53,411 INFO L124 PetriNetUnfolderBase]: 180/3058 cut-off events. [2025-03-13 22:23:53,412 INFO L125 PetriNetUnfolderBase]: For 46/60 co-relation queries the response was YES. [2025-03-13 22:23:53,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 3058 events. 180/3058 cut-off events. For 46/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22280 event pairs, 37 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 2527. Up to 139 conditions per place. [2025-03-13 22:23:53,499 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1019 dead transitions. [2025-03-13 22:23:53,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1019 transitions, 2156 flow [2025-03-13 22:23:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-13 22:23:53,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-13 22:23:53,502 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2104 flow. Second operand 3 states and 3232 transitions. [2025-03-13 22:23:53,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1019 transitions, 2156 flow [2025-03-13 22:23:53,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1019 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:53,512 INFO L231 Difference]: Finished difference. Result has 987 places, 1017 transitions, 2100 flow [2025-03-13 22:23:53,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1017} [2025-03-13 22:23:53,516 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-03-13 22:23:53,517 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1017 transitions, 2100 flow [2025-03-13 22:23:53,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:53,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:53,517 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] [2025-03-13 22:23:53,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:23:53,518 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:53,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash 340453243, now seen corresponding path program 1 times [2025-03-13 22:23:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:53,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648346970] [2025-03-13 22:23:53,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:53,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-13 22:23:53,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-13 22:23:53,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:53,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:53,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:53,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648346970] [2025-03-13 22:23:53,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648346970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:53,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:53,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314464369] [2025-03-13 22:23:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:53,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:53,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:53,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:53,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:53,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-03-13 22:23:53,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1017 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:53,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:53,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-03-13 22:23:53,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:54,653 INFO L124 PetriNetUnfolderBase]: 298/5500 cut-off events. [2025-03-13 22:23:54,654 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-03-13 22:23:54,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 5500 events. 298/5500 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 44911 event pairs, 15 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 5387. Up to 68 conditions per place. [2025-03-13 22:23:54,814 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 20 selfloop transitions, 9 changer transitions 0/1017 dead transitions. [2025-03-13 22:23:54,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1017 transitions, 2160 flow [2025-03-13 22:23:54,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3224 transitions. [2025-03-13 22:23:54,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672967296729673 [2025-03-13 22:23:54,817 INFO L175 Difference]: Start difference. First operand has 987 places, 1017 transitions, 2100 flow. Second operand 3 states and 3224 transitions. [2025-03-13 22:23:54,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1017 transitions, 2160 flow [2025-03-13 22:23:54,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:54,827 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2127 flow [2025-03-13 22:23:54,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2025-03-13 22:23:54,828 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-03-13 22:23:54,828 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2127 flow [2025-03-13 22:23:54,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:54,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:54,829 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] [2025-03-13 22:23:54,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:23:54,829 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:54,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1997670501, now seen corresponding path program 1 times [2025-03-13 22:23:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389457866] [2025-03-13 22:23:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:54,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-13 22:23:54,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-13 22:23:54,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:54,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389457866] [2025-03-13 22:23:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389457866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:54,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:54,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96852684] [2025-03-13 22:23:54,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:54,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:54,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:54,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-13 22:23:54,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:54,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:54,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-13 22:23:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:55,838 INFO L124 PetriNetUnfolderBase]: 285/5368 cut-off events. [2025-03-13 22:23:55,838 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2025-03-13 22:23:55,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 5368 events. 285/5368 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 47683 event pairs, 30 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 5082. Up to 105 conditions per place. [2025-03-13 22:23:55,976 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 23 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2025-03-13 22:23:55,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2183 flow [2025-03-13 22:23:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3236 transitions. [2025-03-13 22:23:55,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708970897089709 [2025-03-13 22:23:55,978 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2127 flow. Second operand 3 states and 3236 transitions. [2025-03-13 22:23:55,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2183 flow [2025-03-13 22:23:55,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1016 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:55,986 INFO L231 Difference]: Finished difference. Result has 982 places, 1014 transitions, 2122 flow [2025-03-13 22:23:55,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=982, PETRI_TRANSITIONS=1014} [2025-03-13 22:23:55,988 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-03-13 22:23:55,988 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1014 transitions, 2122 flow [2025-03-13 22:23:55,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:55,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:55,989 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] [2025-03-13 22:23:55,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:23:55,989 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:55,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash -583627212, now seen corresponding path program 1 times [2025-03-13 22:23:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21913262] [2025-03-13 22:23:55,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:56,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-13 22:23:56,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-13 22:23:56,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:56,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21913262] [2025-03-13 22:23:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21913262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:56,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:56,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:56,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046919848] [2025-03-13 22:23:56,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:56,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:56,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:56,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:56,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-03-13 22:23:56,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1014 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:56,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:56,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-03-13 22:23:56,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:56,603 INFO L124 PetriNetUnfolderBase]: 174/3080 cut-off events. [2025-03-13 22:23:56,604 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-03-13 22:23:56,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 3080 events. 174/3080 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 21955 event pairs, 21 based on Foata normal form. 2/2608 useless extension candidates. Maximal degree in co-relation 2561. Up to 91 conditions per place. [2025-03-13 22:23:56,691 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 16 selfloop transitions, 8 changer transitions 14/1014 dead transitions. [2025-03-13 22:23:56,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 1014 transitions, 2180 flow [2025-03-13 22:23:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3223 transitions. [2025-03-13 22:23:56,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966996699669967 [2025-03-13 22:23:56,694 INFO L175 Difference]: Start difference. First operand has 982 places, 1014 transitions, 2122 flow. Second operand 3 states and 3223 transitions. [2025-03-13 22:23:56,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 1014 transitions, 2180 flow [2025-03-13 22:23:56,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 1014 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:56,710 INFO L231 Difference]: Finished difference. Result has 977 places, 998 transitions, 2111 flow [2025-03-13 22:23:56,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=977, PETRI_TRANSITIONS=998} [2025-03-13 22:23:56,711 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -64 predicate places. [2025-03-13 22:23:56,712 INFO L471 AbstractCegarLoop]: Abstraction has has 977 places, 998 transitions, 2111 flow [2025-03-13 22:23:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:56,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:56,713 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] [2025-03-13 22:23:56,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:23:56,713 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 28013676, now seen corresponding path program 1 times [2025-03-13 22:23:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005600701] [2025-03-13 22:23:56,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:56,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-13 22:23:56,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-13 22:23:56,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:56,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005600701] [2025-03-13 22:23:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005600701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:23:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031328375] [2025-03-13 22:23:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:56,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:56,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:56,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-13 22:23:56,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 998 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:56,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:56,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-13 22:23:56,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:57,760 INFO L124 PetriNetUnfolderBase]: 215/4625 cut-off events. [2025-03-13 22:23:57,761 INFO L125 PetriNetUnfolderBase]: For 40/50 co-relation queries the response was YES. [2025-03-13 22:23:57,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 4625 events. 215/4625 cut-off events. For 40/50 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39030 event pairs, 4 based on Foata normal form. 1/3903 useless extension candidates. Maximal degree in co-relation 4558. Up to 73 conditions per place. [2025-03-13 22:23:57,860 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2025-03-13 22:23:57,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 1003 transitions, 2161 flow [2025-03-13 22:23:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3253 transitions. [2025-03-13 22:23:57,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975997599759976 [2025-03-13 22:23:57,863 INFO L175 Difference]: Start difference. First operand has 977 places, 998 transitions, 2111 flow. Second operand 3 states and 3253 transitions. [2025-03-13 22:23:57,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 1003 transitions, 2161 flow [2025-03-13 22:23:57,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 1003 transitions, 2153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:57,872 INFO L231 Difference]: Finished difference. Result has 966 places, 999 transitions, 2117 flow [2025-03-13 22:23:57,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2117, PETRI_PLACES=966, PETRI_TRANSITIONS=999} [2025-03-13 22:23:57,873 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -75 predicate places. [2025-03-13 22:23:57,874 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 999 transitions, 2117 flow [2025-03-13 22:23:57,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:57,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:57,874 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] [2025-03-13 22:23:57,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:23:57,875 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:23:57,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1156551223, now seen corresponding path program 1 times [2025-03-13 22:23:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519172606] [2025-03-13 22:23:57,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:57,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-13 22:23:57,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-13 22:23:57,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:57,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:57,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:57,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519172606] [2025-03-13 22:23:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519172606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91614575] [2025-03-13 22:23:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:57,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:57,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:57,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:57,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:57,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-13 22:23:57,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 999 transitions, 2117 flow. Second operand has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:57,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:57,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-13 22:23:57,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:59,865 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2025-03-13 22:23:59,865 INFO L125 PetriNetUnfolderBase]: For 6/42 co-relation queries the response was YES. [2025-03-13 22:24:00,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 9044 events. 488/9044 cut-off events. For 6/42 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 83269 event pairs, 14 based on Foata normal form. 2/7653 useless extension candidates. Maximal degree in co-relation 8207. Up to 166 conditions per place. [2025-03-13 22:24:00,118 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-03-13 22:24:00,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2179 flow [2025-03-13 22:24:00,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-13 22:24:00,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-13 22:24:00,120 INFO L175 Difference]: Start difference. First operand has 966 places, 999 transitions, 2117 flow. Second operand 3 states and 3211 transitions. [2025-03-13 22:24:00,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2179 flow [2025-03-13 22:24:00,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:00,129 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2025-03-13 22:24:00,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2025-03-13 22:24:00,130 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-03-13 22:24:00,130 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2025-03-13 22:24:00,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:00,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:00,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:00,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:24:00,131 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:00,132 INFO L85 PathProgramCache]: Analyzing trace with hash -837489279, now seen corresponding path program 1 times [2025-03-13 22:24:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400317483] [2025-03-13 22:24:00,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:00,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 22:24:00,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 22:24:00,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:00,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:00,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400317483] [2025-03-13 22:24:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400317483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9021838] [2025-03-13 22:24:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:00,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:00,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:00,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-13 22:24:00,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:00,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:00,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-13 22:24:00,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:01,006 INFO L124 PetriNetUnfolderBase]: 243/3759 cut-off events. [2025-03-13 22:24:01,006 INFO L125 PetriNetUnfolderBase]: For 199/217 co-relation queries the response was YES. [2025-03-13 22:24:01,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 3759 events. 243/3759 cut-off events. For 199/217 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 30779 event pairs, 36 based on Foata normal form. 1/3174 useless extension candidates. Maximal degree in co-relation 3606. Up to 212 conditions per place. [2025-03-13 22:24:01,120 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 20 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-03-13 22:24:01,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2201 flow [2025-03-13 22:24:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2025-03-13 22:24:01,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96999699969997 [2025-03-13 22:24:01,122 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3233 transitions. [2025-03-13 22:24:01,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2201 flow [2025-03-13 22:24:01,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:01,130 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2025-03-13 22:24:01,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2025-03-13 22:24:01,131 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -81 predicate places. [2025-03-13 22:24:01,131 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2025-03-13 22:24:01,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:01,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:01,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:01,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:24:01,132 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:01,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1304405235, now seen corresponding path program 1 times [2025-03-13 22:24:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537715567] [2025-03-13 22:24:01,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:01,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:01,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-13 22:24:01,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-13 22:24:01,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:01,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537715567] [2025-03-13 22:24:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537715567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:01,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:01,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841634790] [2025-03-13 22:24:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:01,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:01,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:01,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:01,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:24:01,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:01,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:01,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:24:01,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:02,825 INFO L124 PetriNetUnfolderBase]: 367/7045 cut-off events. [2025-03-13 22:24:02,825 INFO L125 PetriNetUnfolderBase]: For 97/135 co-relation queries the response was YES. [2025-03-13 22:24:02,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 7045 events. 367/7045 cut-off events. For 97/135 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68114 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6189. Up to 147 conditions per place. [2025-03-13 22:24:03,034 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2025-03-13 22:24:03,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2195 flow [2025-03-13 22:24:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-13 22:24:03,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-13 22:24:03,035 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3231 transitions. [2025-03-13 22:24:03,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2195 flow [2025-03-13 22:24:03,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:03,045 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2025-03-13 22:24:03,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2025-03-13 22:24:03,046 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -82 predicate places. [2025-03-13 22:24:03,046 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2025-03-13 22:24:03,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:03,046 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] [2025-03-13 22:24:03,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:24:03,046 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:03,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash -572587610, now seen corresponding path program 1 times [2025-03-13 22:24:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:03,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101035854] [2025-03-13 22:24:03,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:03,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-13 22:24:03,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-13 22:24:03,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:03,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:03,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:03,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101035854] [2025-03-13 22:24:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101035854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:03,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:24:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205059901] [2025-03-13 22:24:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:03,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:03,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:03,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:03,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-13 22:24:03,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:03,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-13 22:24:03,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:04,711 INFO L124 PetriNetUnfolderBase]: 267/5701 cut-off events. [2025-03-13 22:24:04,712 INFO L125 PetriNetUnfolderBase]: For 14/70 co-relation queries the response was YES. [2025-03-13 22:24:04,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 5701 events. 267/5701 cut-off events. For 14/70 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50656 event pairs, 8 based on Foata normal form. 0/4817 useless extension candidates. Maximal degree in co-relation 4923. Up to 89 conditions per place. [2025-03-13 22:24:04,969 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2025-03-13 22:24:04,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2025-03-13 22:24:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3252 transitions. [2025-03-13 22:24:04,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9756975697569757 [2025-03-13 22:24:04,971 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3252 transitions. [2025-03-13 22:24:04,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2025-03-13 22:24:04,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:04,980 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2025-03-13 22:24:04,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2025-03-13 22:24:04,982 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-03-13 22:24:04,982 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2025-03-13 22:24:04,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:04,983 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] [2025-03-13 22:24:04,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:24:04,983 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1486206755, now seen corresponding path program 1 times [2025-03-13 22:24:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:04,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3373851] [2025-03-13 22:24:04,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:04,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-13 22:24:04,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-13 22:24:04,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:04,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3373851] [2025-03-13 22:24:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3373851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:05,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:05,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274033943] [2025-03-13 22:24:05,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:05,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:05,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:05,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-13 22:24:05,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:05,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:05,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-13 22:24:05,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:08,185 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2025-03-13 22:24:08,185 INFO L125 PetriNetUnfolderBase]: For 84/240 co-relation queries the response was YES. [2025-03-13 22:24:08,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 10693 events. 631/10693 cut-off events. For 84/240 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 110170 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9704. Up to 336 conditions per place. [2025-03-13 22:24:08,680 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2025-03-13 22:24:08,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2025-03-13 22:24:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-13 22:24:08,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-13 22:24:08,681 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3211 transitions. [2025-03-13 22:24:08,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2025-03-13 22:24:08,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:08,691 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2025-03-13 22:24:08,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2025-03-13 22:24:08,692 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -85 predicate places. [2025-03-13 22:24:08,692 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2025-03-13 22:24:08,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:08,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:08,693 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] [2025-03-13 22:24:08,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:24:08,693 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1625524206, now seen corresponding path program 1 times [2025-03-13 22:24:08,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549091036] [2025-03-13 22:24:08,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:08,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-13 22:24:08,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-13 22:24:08,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:08,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549091036] [2025-03-13 22:24:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549091036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:08,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269689799] [2025-03-13 22:24:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:08,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:08,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:08,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:24:08,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:08,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:08,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:24:08,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:11,654 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2025-03-13 22:24:11,654 INFO L125 PetriNetUnfolderBase]: For 386/637 co-relation queries the response was YES. [2025-03-13 22:24:12,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 8694 events. 484/8694 cut-off events. For 386/637 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 92440 event pairs, 59 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7686. Up to 284 conditions per place. [2025-03-13 22:24:12,118 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2025-03-13 22:24:12,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2025-03-13 22:24:12,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-13 22:24:12,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-13 22:24:12,119 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3231 transitions. [2025-03-13 22:24:12,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2025-03-13 22:24:12,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:12,129 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2025-03-13 22:24:12,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2025-03-13 22:24:12,131 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -86 predicate places. [2025-03-13 22:24:12,131 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2025-03-13 22:24:12,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:12,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:12,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:12,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 22:24:12,132 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1729275389, now seen corresponding path program 1 times [2025-03-13 22:24:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:12,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656015036] [2025-03-13 22:24:12,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:12,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-13 22:24:12,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-13 22:24:12,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:12,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:12,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656015036] [2025-03-13 22:24:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656015036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:12,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:12,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115862752] [2025-03-13 22:24:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:12,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:12,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:12,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:12,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-13 22:24:12,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:12,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:12,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-13 22:24:12,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:13,618 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2025-03-13 22:24:13,618 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-03-13 22:24:13,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 48310 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2025-03-13 22:24:13,838 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2025-03-13 22:24:13,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2025-03-13 22:24:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-13 22:24:13,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-03-13 22:24:13,839 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3235 transitions. [2025-03-13 22:24:13,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2025-03-13 22:24:13,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:13,847 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2025-03-13 22:24:13,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2025-03-13 22:24:13,848 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -90 predicate places. [2025-03-13 22:24:13,848 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2025-03-13 22:24:13,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:13,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:13,849 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] [2025-03-13 22:24:13,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-13 22:24:13,849 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:13,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1382690145, now seen corresponding path program 1 times [2025-03-13 22:24:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737373300] [2025-03-13 22:24:13,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:13,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-13 22:24:13,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-13 22:24:13,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:13,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:13,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737373300] [2025-03-13 22:24:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737373300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:13,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:13,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:24:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369999157] [2025-03-13 22:24:13,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:13,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:13,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:13,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:13,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-13 22:24:13,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:13,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:13,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-13 22:24:13,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:16,609 INFO L124 PetriNetUnfolderBase]: 386/8449 cut-off events. [2025-03-13 22:24:16,610 INFO L125 PetriNetUnfolderBase]: For 37/73 co-relation queries the response was YES. [2025-03-13 22:24:16,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9048 conditions, 8449 events. 386/8449 cut-off events. For 37/73 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 77381 event pairs, 16 based on Foata normal form. 2/7129 useless extension candidates. Maximal degree in co-relation 7625. Up to 183 conditions per place. [2025-03-13 22:24:16,858 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2025-03-13 22:24:16,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2025-03-13 22:24:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3251 transitions. [2025-03-13 22:24:16,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9753975397539754 [2025-03-13 22:24:16,860 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3251 transitions. [2025-03-13 22:24:16,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2025-03-13 22:24:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:16,869 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2025-03-13 22:24:16,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2025-03-13 22:24:16,870 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -88 predicate places. [2025-03-13 22:24:16,870 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2025-03-13 22:24:16,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:16,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:16,871 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] [2025-03-13 22:24:16,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-13 22:24:16,871 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:16,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:16,872 INFO L85 PathProgramCache]: Analyzing trace with hash 366760060, now seen corresponding path program 1 times [2025-03-13 22:24:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:16,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943847886] [2025-03-13 22:24:16,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:16,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-13 22:24:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-13 22:24:16,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:16,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:16,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943847886] [2025-03-13 22:24:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943847886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44726044] [2025-03-13 22:24:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:16,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:16,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-13 22:24:16,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:16,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:16,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-13 22:24:16,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:20,056 INFO L124 PetriNetUnfolderBase]: 674/9720 cut-off events. [2025-03-13 22:24:20,057 INFO L125 PetriNetUnfolderBase]: For 301/368 co-relation queries the response was YES. [2025-03-13 22:24:20,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11215 conditions, 9720 events. 674/9720 cut-off events. For 301/368 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 108716 event pairs, 166 based on Foata normal form. 2/8329 useless extension candidates. Maximal degree in co-relation 9620. Up to 682 conditions per place. [2025-03-13 22:24:20,389 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2025-03-13 22:24:20,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2025-03-13 22:24:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-13 22:24:20,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-13 22:24:20,391 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3211 transitions. [2025-03-13 22:24:20,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2025-03-13 22:24:20,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:24:20,399 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2025-03-13 22:24:20,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2025-03-13 22:24:20,400 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -93 predicate places. [2025-03-13 22:24:20,400 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2025-03-13 22:24:20,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:20,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:20,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:24:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-13 22:24:20,401 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1282415306, now seen corresponding path program 1 times [2025-03-13 22:24:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571454107] [2025-03-13 22:24:20,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:20,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-13 22:24:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-13 22:24:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571454107] [2025-03-13 22:24:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571454107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317934612] [2025-03-13 22:24:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:20,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:20,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:20,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:20,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-13 22:24:20,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:20,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:20,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-13 22:24:20,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:23,613 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2025-03-13 22:24:23,613 INFO L125 PetriNetUnfolderBase]: For 903/986 co-relation queries the response was YES. [2025-03-13 22:24:23,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 903/986 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 112713 event pairs, 190 based on Foata normal form. 2/8817 useless extension candidates. Maximal degree in co-relation 10496. Up to 585 conditions per place. [2025-03-13 22:24:24,064 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2025-03-13 22:24:24,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2025-03-13 22:24:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-13 22:24:24,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-13 22:24:24,066 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3231 transitions. [2025-03-13 22:24:24,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2025-03-13 22:24:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:24,077 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2025-03-13 22:24:24,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2025-03-13 22:24:24,078 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -94 predicate places. [2025-03-13 22:24:24,078 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2025-03-13 22:24:24,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:24,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:24,078 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] [2025-03-13 22:24:24,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-13 22:24:24,079 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash -58656648, now seen corresponding path program 1 times [2025-03-13 22:24:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939496609] [2025-03-13 22:24:24,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:24,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-13 22:24:24,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-13 22:24:24,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:24,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:24,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939496609] [2025-03-13 22:24:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939496609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:24,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:24,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609616978] [2025-03-13 22:24:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:24,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:24,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:24,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:24,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-13 22:24:24,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:24,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:24,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-13 22:24:24,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:27,428 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2025-03-13 22:24:27,428 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-03-13 22:24:27,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 8876 events. 450/8876 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 92082 event pairs, 11 based on Foata normal form. 0/7728 useless extension candidates. Maximal degree in co-relation 7688. Up to 204 conditions per place. [2025-03-13 22:24:27,934 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2025-03-13 22:24:27,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2025-03-13 22:24:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-13 22:24:27,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-03-13 22:24:27,936 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3235 transitions. [2025-03-13 22:24:27,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2025-03-13 22:24:27,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:27,947 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2025-03-13 22:24:27,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=943, PETRI_TRANSITIONS=977} [2025-03-13 22:24:27,948 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -98 predicate places. [2025-03-13 22:24:27,948 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2025-03-13 22:24:27,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:27,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:27,949 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] [2025-03-13 22:24:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-13 22:24:27,949 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-13 22:24:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 37283626, now seen corresponding path program 1 times [2025-03-13 22:24:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044939306] [2025-03-13 22:24:27,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-13 22:24:27,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-13 22:24:27,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:27,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:27,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:27,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044939306] [2025-03-13 22:24:27,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044939306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:27,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:27,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246338539] [2025-03-13 22:24:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:27,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:27,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:27,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:28,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-03-13 22:24:28,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:28,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:28,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-03-13 22:24:28,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand