./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:11:42,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:11:42,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:11:42,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:11:42,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:11:42,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:11:42,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:11:42,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:11:42,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:11:42,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:11:42,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:11:42,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:11:42,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:11:42,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:42,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:11:42,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:11:42,876 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2025-03-17 11:11:43,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:11:43,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:11:43,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:11:43,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:11:43,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:11:43,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-17 11:11:44,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66cf739b4/cfffa6c0e27445c28e32df21c275c1e7/FLAG8df41f7ea [2025-03-17 11:11:44,501 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:11:44,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2025-03-17 11:11:44,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66cf739b4/cfffa6c0e27445c28e32df21c275c1e7/FLAG8df41f7ea [2025-03-17 11:11:44,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66cf739b4/cfffa6c0e27445c28e32df21c275c1e7 [2025-03-17 11:11:44,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:11:44,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:11:44,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:44,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:11:44,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:11:44,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:44" (1/1) ... [2025-03-17 11:11:44,819 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 17.03 11:11:44, skipping insertion in model container [2025-03-17 11:11:44,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:11:44" (1/1) ... [2025-03-17 11:11:44,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:11:45,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:45,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:11:45,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:11:45,100 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:11:45,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45 WrapperNode [2025-03-17 11:11:45,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:11:45,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:45,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:11:45,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:11:45,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,166 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 838 [2025-03-17 11:11:45,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:11:45,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:11:45,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:11:45,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:11:45,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:11:45,207 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:11:45,207 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:11:45,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:11:45,208 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (1/1) ... [2025-03-17 11:11:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:11:45,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:11:45,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:11:45,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:11:45,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:11:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:11:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:11:45,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:11:45,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:11:45,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:11:45,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:11:45,268 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:11:45,382 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:11:45,384 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:11:46,198 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:11:46,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:11:46,219 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:11:46,219 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:11:46,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:46 BoogieIcfgContainer [2025-03-17 11:11:46,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:11:46,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:11:46,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:11:46,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:11:46,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:11:44" (1/3) ... [2025-03-17 11:11:46,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:46, skipping insertion in model container [2025-03-17 11:11:46,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:11:45" (2/3) ... [2025-03-17 11:11:46,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:11:46, skipping insertion in model container [2025-03-17 11:11:46,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:11:46" (3/3) ... [2025-03-17 11:11:46,229 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2025-03-17 11:11:46,239 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:11:46,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-trans.wvr.c that has 4 procedures, 1049 locations, 1 initial locations, 4 loop locations, and 149 error locations. [2025-03-17 11:11:46,240 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:11:46,398 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-17 11:11:46,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1058 places, 1105 transitions, 2231 flow [2025-03-17 11:11:46,830 INFO L124 PetriNetUnfolderBase]: 57/1102 cut-off events. [2025-03-17 11:11:46,833 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 11:11:46,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1102 events. 57/1102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3892 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-17 11:11:46,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 1058 places, 1105 transitions, 2231 flow [2025-03-17 11:11:46,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1036 places, 1081 transitions, 2180 flow [2025-03-17 11:11:46,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:11:46,907 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;@47f37499, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:11:46,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 281 error locations. [2025-03-17 11:11:46,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:11:46,915 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-17 11:11:46,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:11:46,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:46,916 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-17 11:11:46,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:46,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash 849605460, now seen corresponding path program 1 times [2025-03-17 11:11:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-17 11:11:46,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:46,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:11:46,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:11:46,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:46,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:47,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:47,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-17 11:11:47,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208791508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:47,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:47,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754707899] [2025-03-17 11:11:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:47,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:47,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:47,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:47,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:11:47,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1081 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:47,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:47,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:11:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:48,457 INFO L124 PetriNetUnfolderBase]: 227/4391 cut-off events. [2025-03-17 11:11:48,457 INFO L125 PetriNetUnfolderBase]: For 57/64 co-relation queries the response was YES. [2025-03-17 11:11:48,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 4391 events. 227/4391 cut-off events. For 57/64 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 33690 event pairs, 45 based on Foata normal form. 207/3682 useless extension candidates. Maximal degree in co-relation 3736. Up to 110 conditions per place. [2025-03-17 11:11:48,565 INFO L140 encePairwiseOnDemand]: 1085/1105 looper letters, 19 selfloop transitions, 2 changer transitions 2/1063 dead transitions. [2025-03-17 11:11:48,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 1063 transitions, 2186 flow [2025-03-17 11:11:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3228 transitions. [2025-03-17 11:11:48,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9737556561085973 [2025-03-17 11:11:48,583 INFO L175 Difference]: Start difference. First operand has 1036 places, 1081 transitions, 2180 flow. Second operand 3 states and 3228 transitions. [2025-03-17 11:11:48,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 1063 transitions, 2186 flow [2025-03-17 11:11:48,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:11:48,641 INFO L231 Difference]: Finished difference. Result has 1031 places, 1061 transitions, 2132 flow [2025-03-17 11:11:48,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1029, 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=2132, PETRI_PLACES=1031, PETRI_TRANSITIONS=1061} [2025-03-17 11:11:48,647 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -5 predicate places. [2025-03-17 11:11:48,647 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1061 transitions, 2132 flow [2025-03-17 11:11:48,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:48,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:48,650 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-17 11:11:48,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:11:48,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:48,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1157339164, now seen corresponding path program 1 times [2025-03-17 11:11:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:48,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143321848] [2025-03-17 11:11:48,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:48,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:48,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 11:11:48,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 11:11:48,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:48,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:48,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143321848] [2025-03-17 11:11:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143321848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:48,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:48,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527519213] [2025-03-17 11:11:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:48,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:48,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:48,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:48,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:48,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:11:48,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:48,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:48,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:11:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:51,121 INFO L124 PetriNetUnfolderBase]: 613/12175 cut-off events. [2025-03-17 11:11:51,122 INFO L125 PetriNetUnfolderBase]: For 6/24 co-relation queries the response was YES. [2025-03-17 11:11:51,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 12175 events. 613/12175 cut-off events. For 6/24 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 120735 event pairs, 95 based on Foata normal form. 0/9562 useless extension candidates. Maximal degree in co-relation 12368. Up to 185 conditions per place. [2025-03-17 11:11:51,287 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 19 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2025-03-17 11:11:51,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1060 transitions, 2172 flow [2025-03-17 11:11:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-17 11:11:51,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686274509803922 [2025-03-17 11:11:51,294 INFO L175 Difference]: Start difference. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand 3 states and 3211 transitions. [2025-03-17 11:11:51,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1060 transitions, 2172 flow [2025-03-17 11:11:51,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1060 transitions, 2168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:51,308 INFO L231 Difference]: Finished difference. Result has 1028 places, 1060 transitions, 2130 flow [2025-03-17 11:11:51,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1026, 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=1028, PETRI_TRANSITIONS=1060} [2025-03-17 11:11:51,310 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -8 predicate places. [2025-03-17 11:11:51,311 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1060 transitions, 2130 flow [2025-03-17 11:11:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:51,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:51,312 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-17 11:11:51,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:11:51,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:51,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1810841807, now seen corresponding path program 1 times [2025-03-17 11:11:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:51,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374899405] [2025-03-17 11:11:51,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:51,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 11:11:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 11:11:51,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:51,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374899405] [2025-03-17 11:11:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374899405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883496738] [2025-03-17 11:11:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:51,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:11:51,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:51,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:51,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:11:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:52,615 INFO L124 PetriNetUnfolderBase]: 241/3573 cut-off events. [2025-03-17 11:11:52,615 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-03-17 11:11:52,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3772 conditions, 3573 events. 241/3573 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27255 event pairs, 95 based on Foata normal form. 0/2832 useless extension candidates. Maximal degree in co-relation 3723. Up to 185 conditions per place. [2025-03-17 11:11:52,747 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 19 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2025-03-17 11:11:52,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1059 transitions, 2170 flow [2025-03-17 11:11:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-17 11:11:52,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686274509803922 [2025-03-17 11:11:52,754 INFO L175 Difference]: Start difference. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand 3 states and 3211 transitions. [2025-03-17 11:11:52,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1059 transitions, 2170 flow [2025-03-17 11:11:52,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1059 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:52,771 INFO L231 Difference]: Finished difference. Result has 1027 places, 1059 transitions, 2128 flow [2025-03-17 11:11:52,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1025, 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=1027, PETRI_TRANSITIONS=1059} [2025-03-17 11:11:52,773 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -9 predicate places. [2025-03-17 11:11:52,773 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1059 transitions, 2128 flow [2025-03-17 11:11:52,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:52,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:52,775 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-17 11:11:52,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:11:52,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:52,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -457989490, now seen corresponding path program 1 times [2025-03-17 11:11:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510196302] [2025-03-17 11:11:52,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:52,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:11:52,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:11:52,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:52,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510196302] [2025-03-17 11:11:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510196302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:52,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267562035] [2025-03-17 11:11:52,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:52,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:52,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:52,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:52,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:52,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1105 [2025-03-17 11:11:52,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:52,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:52,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1105 [2025-03-17 11:11:52,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:54,063 INFO L124 PetriNetUnfolderBase]: 246/5498 cut-off events. [2025-03-17 11:11:54,063 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:11:54,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 5498 events. 246/5498 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 43711 event pairs, 16 based on Foata normal form. 0/4346 useless extension candidates. Maximal degree in co-relation 5517. Up to 51 conditions per place. [2025-03-17 11:11:54,237 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2025-03-17 11:11:54,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1058 transitions, 2166 flow [2025-03-17 11:11:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-17 11:11:54,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-17 11:11:54,242 INFO L175 Difference]: Start difference. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand 3 states and 3213 transitions. [2025-03-17 11:11:54,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1058 transitions, 2166 flow [2025-03-17 11:11:54,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1058 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:54,255 INFO L231 Difference]: Finished difference. Result has 1026 places, 1058 transitions, 2126 flow [2025-03-17 11:11:54,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1024, 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=1026, PETRI_TRANSITIONS=1058} [2025-03-17 11:11:54,257 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -10 predicate places. [2025-03-17 11:11:54,257 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1058 transitions, 2126 flow [2025-03-17 11:11:54,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:54,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:54,259 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-17 11:11:54,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:11:54,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:54,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1733497961, now seen corresponding path program 1 times [2025-03-17 11:11:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-03-17 11:11:54,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:54,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 11:11:54,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 11:11:54,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:54,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:54,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-17 11:11:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-03-17 11:11:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223291006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:54,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259843695] [2025-03-17 11:11:54,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:54,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:54,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:54,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:54,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1105 [2025-03-17 11:11:54,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1058 transitions, 2126 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-17 11:11:54,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:54,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1105 [2025-03-17 11:11:54,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:54,653 INFO L124 PetriNetUnfolderBase]: 74/1607 cut-off events. [2025-03-17 11:11:54,653 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:11:54,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1607 events. 74/1607 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8224 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1603. Up to 40 conditions per place. [2025-03-17 11:11:54,700 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2025-03-17 11:11:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1057 transitions, 2158 flow [2025-03-17 11:11:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2025-03-17 11:11:54,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710407239819004 [2025-03-17 11:11:54,705 INFO L175 Difference]: Start difference. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand 3 states and 3219 transitions. [2025-03-17 11:11:54,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1057 transitions, 2158 flow [2025-03-17 11:11:54,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:54,717 INFO L231 Difference]: Finished difference. Result has 1025 places, 1057 transitions, 2124 flow [2025-03-17 11:11:54,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1023, 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=1025, PETRI_TRANSITIONS=1057} [2025-03-17 11:11:54,719 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -11 predicate places. [2025-03-17 11:11:54,719 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1057 transitions, 2124 flow [2025-03-17 11:11:54,721 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-17 11:11:54,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:54,721 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-17 11:11:54,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:11:54,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1286066653, now seen corresponding path program 1 times [2025-03-17 11:11:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:54,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358424306] [2025-03-17 11:11:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:54,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 11:11:54,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 11:11:54,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:54,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358424306] [2025-03-17 11:11:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358424306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:54,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661385550] [2025-03-17 11:11:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:54,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:54,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:54,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:54,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1105 [2025-03-17 11:11:54,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:54,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:54,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1105 [2025-03-17 11:11:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:55,662 INFO L124 PetriNetUnfolderBase]: 168/3831 cut-off events. [2025-03-17 11:11:55,663 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-03-17 11:11:55,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 3831 events. 168/3831 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 25998 event pairs, 10 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 3812. Up to 35 conditions per place. [2025-03-17 11:11:55,734 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2025-03-17 11:11:55,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1056 transitions, 2154 flow [2025-03-17 11:11:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2025-03-17 11:11:55,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716440422322775 [2025-03-17 11:11:55,738 INFO L175 Difference]: Start difference. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand 3 states and 3221 transitions. [2025-03-17 11:11:55,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1056 transitions, 2154 flow [2025-03-17 11:11:55,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:55,748 INFO L231 Difference]: Finished difference. Result has 1024 places, 1056 transitions, 2122 flow [2025-03-17 11:11:55,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1022, 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=1024, PETRI_TRANSITIONS=1056} [2025-03-17 11:11:55,750 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -12 predicate places. [2025-03-17 11:11:55,750 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1056 transitions, 2122 flow [2025-03-17 11:11:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:55,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:55,752 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-17 11:11:55,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:11:55,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:55,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash -595344033, now seen corresponding path program 1 times [2025-03-17 11:11:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650392618] [2025-03-17 11:11:55,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:55,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 11:11:55,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 11:11:55,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:55,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:55,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650392618] [2025-03-17 11:11:55,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650392618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:55,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348276144] [2025-03-17 11:11:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:55,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:55,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:55,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1105 [2025-03-17 11:11:55,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:55,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:55,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1105 [2025-03-17 11:11:55,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:57,883 INFO L124 PetriNetUnfolderBase]: 350/7715 cut-off events. [2025-03-17 11:11:57,883 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-17 11:11:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 7715 events. 350/7715 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 68292 event pairs, 24 based on Foata normal form. 0/6092 useless extension candidates. Maximal degree in co-relation 7737. Up to 70 conditions per place. [2025-03-17 11:11:58,081 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2025-03-17 11:11:58,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1055 transitions, 2166 flow [2025-03-17 11:11:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-03-17 11:11:58,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967420814479638 [2025-03-17 11:11:58,086 INFO L175 Difference]: Start difference. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand 3 states and 3207 transitions. [2025-03-17 11:11:58,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1055 transitions, 2166 flow [2025-03-17 11:11:58,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:58,099 INFO L231 Difference]: Finished difference. Result has 1023 places, 1055 transitions, 2120 flow [2025-03-17 11:11:58,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1021, 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=1023, PETRI_TRANSITIONS=1055} [2025-03-17 11:11:58,100 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -13 predicate places. [2025-03-17 11:11:58,100 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1055 transitions, 2120 flow [2025-03-17 11:11:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:58,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:58,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:11:58,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:11:58,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:58,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:58,103 INFO L85 PathProgramCache]: Analyzing trace with hash 998058723, now seen corresponding path program 1 times [2025-03-17 11:11:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:58,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760187621] [2025-03-17 11:11:58,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:58,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:58,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 11:11:58,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 11:11:58,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:58,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:58,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760187621] [2025-03-17 11:11:58,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760187621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:58,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:58,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473680234] [2025-03-17 11:11:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:58,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:58,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:58,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:58,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:58,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1105 [2025-03-17 11:11:58,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:58,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:58,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1105 [2025-03-17 11:11:58,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:59,103 INFO L124 PetriNetUnfolderBase]: 150/3278 cut-off events. [2025-03-17 11:11:59,103 INFO L125 PetriNetUnfolderBase]: For 9/33 co-relation queries the response was YES. [2025-03-17 11:11:59,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 3278 events. 150/3278 cut-off events. For 9/33 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21488 event pairs, 16 based on Foata normal form. 0/2607 useless extension candidates. Maximal degree in co-relation 3257. Up to 51 conditions per place. [2025-03-17 11:11:59,248 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2025-03-17 11:11:59,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1054 transitions, 2158 flow [2025-03-17 11:11:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-17 11:11:59,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-17 11:11:59,252 INFO L175 Difference]: Start difference. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand 3 states and 3213 transitions. [2025-03-17 11:11:59,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1054 transitions, 2158 flow [2025-03-17 11:11:59,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1054 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:59,263 INFO L231 Difference]: Finished difference. Result has 1022 places, 1054 transitions, 2118 flow [2025-03-17 11:11:59,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1020, 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=1022, PETRI_TRANSITIONS=1054} [2025-03-17 11:11:59,265 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -14 predicate places. [2025-03-17 11:11:59,265 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1054 transitions, 2118 flow [2025-03-17 11:11:59,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:59,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:59,267 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-17 11:11:59,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:11:59,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:59,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1559300917, now seen corresponding path program 1 times [2025-03-17 11:11:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:59,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549651206] [2025-03-17 11:11:59,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:59,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:59,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:11:59,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:11:59,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:59,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549651206] [2025-03-17 11:11:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549651206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:59,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044217736] [2025-03-17 11:11:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:59,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:59,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:59,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:59,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1105 [2025-03-17 11:11:59,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1054 transitions, 2118 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-17 11:11:59,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:59,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1105 [2025-03-17 11:11:59,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:11:59,675 INFO L124 PetriNetUnfolderBase]: 74/1603 cut-off events. [2025-03-17 11:11:59,675 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-03-17 11:11:59,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1603 events. 74/1603 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7771 event pairs, 12 based on Foata normal form. 0/1291 useless extension candidates. Maximal degree in co-relation 1561. Up to 40 conditions per place. [2025-03-17 11:11:59,733 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2025-03-17 11:11:59,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1053 transitions, 2150 flow [2025-03-17 11:11:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:11:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:11:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2025-03-17 11:11:59,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710407239819004 [2025-03-17 11:11:59,737 INFO L175 Difference]: Start difference. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand 3 states and 3219 transitions. [2025-03-17 11:11:59,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1053 transitions, 2150 flow [2025-03-17 11:11:59,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:11:59,747 INFO L231 Difference]: Finished difference. Result has 1021 places, 1053 transitions, 2116 flow [2025-03-17 11:11:59,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1019, 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=1021, PETRI_TRANSITIONS=1053} [2025-03-17 11:11:59,749 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -15 predicate places. [2025-03-17 11:11:59,749 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1053 transitions, 2116 flow [2025-03-17 11:11:59,750 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-17 11:11:59,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:11:59,751 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-17 11:11:59,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:11:59,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:11:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:11:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1715909060, now seen corresponding path program 1 times [2025-03-17 11:11:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:11:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962530899] [2025-03-17 11:11:59,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:11:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:11:59,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 11:11:59,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 11:11:59,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:11:59,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:11:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:11:59,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:11:59,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962530899] [2025-03-17 11:11:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962530899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:11:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:11:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:11:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908549220] [2025-03-17 11:11:59,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:11:59,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:11:59,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:11:59,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:11:59,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:11:59,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1105 [2025-03-17 11:11:59,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:11:59,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:11:59,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1105 [2025-03-17 11:11:59,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:00,340 INFO L124 PetriNetUnfolderBase]: 108/2442 cut-off events. [2025-03-17 11:12:00,340 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-17 11:12:00,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 2442 events. 108/2442 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13656 event pairs, 10 based on Foata normal form. 0/1955 useless extension candidates. Maximal degree in co-relation 2386. Up to 35 conditions per place. [2025-03-17 11:12:00,436 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2025-03-17 11:12:00,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1052 transitions, 2146 flow [2025-03-17 11:12:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2025-03-17 11:12:00,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716440422322775 [2025-03-17 11:12:00,440 INFO L175 Difference]: Start difference. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand 3 states and 3221 transitions. [2025-03-17 11:12:00,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1052 transitions, 2146 flow [2025-03-17 11:12:00,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:00,451 INFO L231 Difference]: Finished difference. Result has 1020 places, 1052 transitions, 2114 flow [2025-03-17 11:12:00,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1018, 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=1020, PETRI_TRANSITIONS=1052} [2025-03-17 11:12:00,452 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -16 predicate places. [2025-03-17 11:12:00,453 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1052 transitions, 2114 flow [2025-03-17 11:12:00,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:00,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:00,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:00,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:12:00,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:00,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1723340800, now seen corresponding path program 1 times [2025-03-17 11:12:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072024607] [2025-03-17 11:12:00,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:00,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:00,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 11:12:00,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 11:12:00,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:00,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:00,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:00,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072024607] [2025-03-17 11:12:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072024607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:00,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824454656] [2025-03-17 11:12:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:00,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:00,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:00,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:00,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1105 [2025-03-17 11:12:00,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:00,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:00,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1105 [2025-03-17 11:12:00,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:01,543 INFO L124 PetriNetUnfolderBase]: 206/4387 cut-off events. [2025-03-17 11:12:01,544 INFO L125 PetriNetUnfolderBase]: For 13/111 co-relation queries the response was YES. [2025-03-17 11:12:01,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 4387 events. 206/4387 cut-off events. For 13/111 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 32343 event pairs, 24 based on Foata normal form. 0/3476 useless extension candidates. Maximal degree in co-relation 4365. Up to 70 conditions per place. [2025-03-17 11:12:01,698 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2025-03-17 11:12:01,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1051 transitions, 2158 flow [2025-03-17 11:12:01,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-03-17 11:12:01,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967420814479638 [2025-03-17 11:12:01,702 INFO L175 Difference]: Start difference. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand 3 states and 3207 transitions. [2025-03-17 11:12:01,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1051 transitions, 2158 flow [2025-03-17 11:12:01,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:01,712 INFO L231 Difference]: Finished difference. Result has 1019 places, 1051 transitions, 2112 flow [2025-03-17 11:12:01,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1017, 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=1019, PETRI_TRANSITIONS=1051} [2025-03-17 11:12:01,714 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -17 predicate places. [2025-03-17 11:12:01,714 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1051 transitions, 2112 flow [2025-03-17 11:12:01,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:01,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:01,714 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-17 11:12:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:12:01,715 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:01,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1262235837, now seen corresponding path program 1 times [2025-03-17 11:12:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011784431] [2025-03-17 11:12:01,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 11:12:01,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 11:12:01,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:01,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011784431] [2025-03-17 11:12:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011784431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941021770] [2025-03-17 11:12:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:01,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:01,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:01,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1105 [2025-03-17 11:12:01,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:01,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:01,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1105 [2025-03-17 11:12:01,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:02,062 INFO L124 PetriNetUnfolderBase]: 78/1568 cut-off events. [2025-03-17 11:12:02,062 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-03-17 11:12:02,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1568 events. 78/1568 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7454 event pairs, 16 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 1509. Up to 53 conditions per place. [2025-03-17 11:12:02,107 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 18 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-17 11:12:02,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1050 transitions, 2150 flow [2025-03-17 11:12:02,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-17 11:12:02,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-17 11:12:02,111 INFO L175 Difference]: Start difference. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand 3 states and 3213 transitions. [2025-03-17 11:12:02,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1050 transitions, 2150 flow [2025-03-17 11:12:02,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1050 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:02,120 INFO L231 Difference]: Finished difference. Result has 1018 places, 1050 transitions, 2110 flow [2025-03-17 11:12:02,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1016, 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=1018, PETRI_TRANSITIONS=1050} [2025-03-17 11:12:02,122 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -18 predicate places. [2025-03-17 11:12:02,122 INFO L471 AbstractCegarLoop]: Abstraction has has 1018 places, 1050 transitions, 2110 flow [2025-03-17 11:12:02,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:02,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:02,123 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-17 11:12:02,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:12:02,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:02,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash -333746295, now seen corresponding path program 1 times [2025-03-17 11:12:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:02,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481074757] [2025-03-17 11:12:02,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:02,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 11:12:02,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 11:12:02,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:02,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:02,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481074757] [2025-03-17 11:12:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481074757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:02,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511520105] [2025-03-17 11:12:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:02,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:02,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:02,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1105 [2025-03-17 11:12:02,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1050 transitions, 2110 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-17 11:12:02,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:02,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1105 [2025-03-17 11:12:02,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:02,495 INFO L124 PetriNetUnfolderBase]: 74/1599 cut-off events. [2025-03-17 11:12:02,495 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-17 11:12:02,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1599 events. 74/1599 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7315 event pairs, 12 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1519. Up to 40 conditions per place. [2025-03-17 11:12:02,538 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-03-17 11:12:02,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1049 transitions, 2142 flow [2025-03-17 11:12:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2025-03-17 11:12:02,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9710407239819004 [2025-03-17 11:12:02,542 INFO L175 Difference]: Start difference. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand 3 states and 3219 transitions. [2025-03-17 11:12:02,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1049 transitions, 2142 flow [2025-03-17 11:12:02,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1049 transitions, 2138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:02,552 INFO L231 Difference]: Finished difference. Result has 1017 places, 1049 transitions, 2108 flow [2025-03-17 11:12:02,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=1017, PETRI_TRANSITIONS=1049} [2025-03-17 11:12:02,554 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -19 predicate places. [2025-03-17 11:12:02,554 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1049 transitions, 2108 flow [2025-03-17 11:12:02,554 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-17 11:12:02,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:02,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:02,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:12:02,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:02,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash -200871837, now seen corresponding path program 1 times [2025-03-17 11:12:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:02,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-03-17 11:12:02,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:02,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 11:12:02,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 11:12:02,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:02,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611645510] [2025-03-17 11:12:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611645510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:02,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:02,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:02,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066857713] [2025-03-17 11:12:02,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:02,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:02,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:02,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:02,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1105 [2025-03-17 11:12:02,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:02,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:02,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1105 [2025-03-17 11:12:02,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:02,828 INFO L124 PetriNetUnfolderBase]: 48/1068 cut-off events. [2025-03-17 11:12:02,828 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-17 11:12:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1068 events. 48/1068 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4321 event pairs, 10 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 975. Up to 35 conditions per place. [2025-03-17 11:12:02,853 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-03-17 11:12:02,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1048 transitions, 2138 flow [2025-03-17 11:12:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2025-03-17 11:12:02,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716440422322775 [2025-03-17 11:12:02,858 INFO L175 Difference]: Start difference. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand 3 states and 3221 transitions. [2025-03-17 11:12:02,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1048 transitions, 2138 flow [2025-03-17 11:12:02,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1048 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:02,867 INFO L231 Difference]: Finished difference. Result has 1016 places, 1048 transitions, 2106 flow [2025-03-17 11:12:02,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1014, 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=1016, PETRI_TRANSITIONS=1048} [2025-03-17 11:12:02,870 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2025-03-17 11:12:02,870 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1048 transitions, 2106 flow [2025-03-17 11:12:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:02,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:02,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] [2025-03-17 11:12:02,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:12:02,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 980625846, now seen corresponding path program 1 times [2025-03-17 11:12:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608629128] [2025-03-17 11:12:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:02,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 11:12:02,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 11:12:02,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:02,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:02,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-17 11:12:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608629128] [2025-03-17 11:12:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608629128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213730119] [2025-03-17 11:12:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:02,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:02,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:02,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:02,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1105 [2025-03-17 11:12:02,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:02,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:02,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1105 [2025-03-17 11:12:02,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:03,233 INFO L124 PetriNetUnfolderBase]: 86/1597 cut-off events. [2025-03-17 11:12:03,233 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-17 11:12:03,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1597 events. 86/1597 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8249 event pairs, 24 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1531. Up to 70 conditions per place. [2025-03-17 11:12:03,277 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 21 selfloop transitions, 2 changer transitions 0/1047 dead transitions. [2025-03-17 11:12:03,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1047 transitions, 2150 flow [2025-03-17 11:12:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2025-03-17 11:12:03,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.967420814479638 [2025-03-17 11:12:03,281 INFO L175 Difference]: Start difference. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand 3 states and 3207 transitions. [2025-03-17 11:12:03,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1047 transitions, 2150 flow [2025-03-17 11:12:03,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1047 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:03,296 INFO L231 Difference]: Finished difference. Result has 1015 places, 1047 transitions, 2104 flow [2025-03-17 11:12:03,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1013, 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=1015, PETRI_TRANSITIONS=1047} [2025-03-17 11:12:03,298 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -21 predicate places. [2025-03-17 11:12:03,298 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1047 transitions, 2104 flow [2025-03-17 11:12:03,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:03,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:03,299 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-17 11:12:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:12:03,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1531112320, now seen corresponding path program 1 times [2025-03-17 11:12:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:03,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964058586] [2025-03-17 11:12:03,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:03,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 11:12:03,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 11:12:03,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:03,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964058586] [2025-03-17 11:12:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964058586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:03,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:03,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393562298] [2025-03-17 11:12:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:03,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:03,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:03,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1105 [2025-03-17 11:12:03,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1047 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-17 11:12:03,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:03,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1105 [2025-03-17 11:12:03,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:03,855 INFO L124 PetriNetUnfolderBase]: 122/2607 cut-off events. [2025-03-17 11:12:03,855 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-17 11:12:03,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 2607 events. 122/2607 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14315 event pairs, 15 based on Foata normal form. 0/2089 useless extension candidates. Maximal degree in co-relation 2510. Up to 43 conditions per place. [2025-03-17 11:12:03,928 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 12 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2025-03-17 11:12:03,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1046 transitions, 2130 flow [2025-03-17 11:12:03,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-17 11:12:03,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9728506787330317 [2025-03-17 11:12:03,932 INFO L175 Difference]: Start difference. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand 3 states and 3225 transitions. [2025-03-17 11:12:03,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1046 transitions, 2130 flow [2025-03-17 11:12:03,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1046 transitions, 2126 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:03,941 INFO L231 Difference]: Finished difference. Result has 1014 places, 1046 transitions, 2102 flow [2025-03-17 11:12:03,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1012, 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=1014, PETRI_TRANSITIONS=1046} [2025-03-17 11:12:03,942 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -22 predicate places. [2025-03-17 11:12:03,942 INFO L471 AbstractCegarLoop]: Abstraction has has 1014 places, 1046 transitions, 2102 flow [2025-03-17 11:12:03,943 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-17 11:12:03,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:03,943 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-17 11:12:03,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:12:03,944 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1855685339, now seen corresponding path program 1 times [2025-03-17 11:12:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080670025] [2025-03-17 11:12:03,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:03,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 11:12:03,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 11:12:03,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:03,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080670025] [2025-03-17 11:12:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080670025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:04,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:12:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130955425] [2025-03-17 11:12:04,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:04,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:12:04,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:04,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:12:04,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:12:04,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1105 [2025-03-17 11:12:04,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 1046 transitions, 2102 flow. Second operand has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:04,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:04,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1105 [2025-03-17 11:12:04,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:07,117 INFO L124 PetriNetUnfolderBase]: 894/12786 cut-off events. [2025-03-17 11:12:07,118 INFO L125 PetriNetUnfolderBase]: For 59/69 co-relation queries the response was YES. [2025-03-17 11:12:07,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13406 conditions, 12786 events. 894/12786 cut-off events. For 59/69 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 132617 event pairs, 264 based on Foata normal form. 0/10058 useless extension candidates. Maximal degree in co-relation 13194. Up to 580 conditions per place. [2025-03-17 11:12:07,329 INFO L140 encePairwiseOnDemand]: 1099/1105 looper letters, 26 selfloop transitions, 5 changer transitions 0/1045 dead transitions. [2025-03-17 11:12:07,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1045 transitions, 2162 flow [2025-03-17 11:12:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:12:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:12:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6356 transitions. [2025-03-17 11:12:07,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9586726998491705 [2025-03-17 11:12:07,338 INFO L175 Difference]: Start difference. First operand has 1014 places, 1046 transitions, 2102 flow. Second operand 6 states and 6356 transitions. [2025-03-17 11:12:07,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1045 transitions, 2162 flow [2025-03-17 11:12:07,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1045 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:07,349 INFO L231 Difference]: Finished difference. Result has 1016 places, 1045 transitions, 2106 flow [2025-03-17 11:12:07,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2106, PETRI_PLACES=1016, PETRI_TRANSITIONS=1045} [2025-03-17 11:12:07,351 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2025-03-17 11:12:07,351 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1045 transitions, 2106 flow [2025-03-17 11:12:07,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:07,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:07,353 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-17 11:12:07,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:12:07,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:07,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash -160656837, now seen corresponding path program 1 times [2025-03-17 11:12:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816276753] [2025-03-17 11:12:07,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:07,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:07,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:12:07,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:12:07,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:07,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816276753] [2025-03-17 11:12:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816276753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990481321] [2025-03-17 11:12:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:07,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:07,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:07,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:07,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1105 [2025-03-17 11:12:07,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1045 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-17 11:12:07,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:07,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1105 [2025-03-17 11:12:07,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:07,734 INFO L124 PetriNetUnfolderBase]: 80/1600 cut-off events. [2025-03-17 11:12:07,735 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:12:07,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1600 events. 80/1600 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8228 event pairs, 14 based on Foata normal form. 0/1301 useless extension candidates. Maximal degree in co-relation 1663. Up to 43 conditions per place. [2025-03-17 11:12:07,782 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2025-03-17 11:12:07,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1046 transitions, 2146 flow [2025-03-17 11:12:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2025-03-17 11:12:07,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731523378582202 [2025-03-17 11:12:07,788 INFO L175 Difference]: Start difference. First operand has 1016 places, 1045 transitions, 2106 flow. Second operand 3 states and 3226 transitions. [2025-03-17 11:12:07,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1046 transitions, 2146 flow [2025-03-17 11:12:07,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1046 transitions, 2136 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:12:07,799 INFO L231 Difference]: Finished difference. Result has 1012 places, 1044 transitions, 2098 flow [2025-03-17 11:12:07,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=1012, PETRI_TRANSITIONS=1044} [2025-03-17 11:12:07,801 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -24 predicate places. [2025-03-17 11:12:07,801 INFO L471 AbstractCegarLoop]: Abstraction has has 1012 places, 1044 transitions, 2098 flow [2025-03-17 11:12:07,802 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-17 11:12:07,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:07,802 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-17 11:12:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:12:07,802 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:07,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 827145835, now seen corresponding path program 1 times [2025-03-17 11:12:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801481004] [2025-03-17 11:12:07,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:07,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 11:12:07,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 11:12:07,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:07,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:07,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:07,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801481004] [2025-03-17 11:12:07,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801481004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:07,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:07,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231442692] [2025-03-17 11:12:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:07,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:07,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:07,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:07,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:07,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:12:07,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1044 transitions, 2098 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-17 11:12:07,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:07,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:12:07,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:08,287 INFO L124 PetriNetUnfolderBase]: 116/2150 cut-off events. [2025-03-17 11:12:08,287 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:12:08,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 2150 events. 116/2150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13261 event pairs, 26 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 2058. Up to 73 conditions per place. [2025-03-17 11:12:08,353 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2025-03-17 11:12:08,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1045 transitions, 2150 flow [2025-03-17 11:12:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2025-03-17 11:12:08,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695324283559578 [2025-03-17 11:12:08,356 INFO L175 Difference]: Start difference. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand 3 states and 3214 transitions. [2025-03-17 11:12:08,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1045 transitions, 2150 flow [2025-03-17 11:12:08,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1045 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:08,368 INFO L231 Difference]: Finished difference. Result has 1011 places, 1043 transitions, 2096 flow [2025-03-17 11:12:08,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=1011, PETRI_TRANSITIONS=1043} [2025-03-17 11:12:08,369 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -25 predicate places. [2025-03-17 11:12:08,369 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1043 transitions, 2096 flow [2025-03-17 11:12:08,370 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-17 11:12:08,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:08,370 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-17 11:12:08,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:12:08,371 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1945156518, now seen corresponding path program 1 times [2025-03-17 11:12:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153022123] [2025-03-17 11:12:08,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:08,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 11:12:08,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 11:12:08,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:08,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:08,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153022123] [2025-03-17 11:12:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153022123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599097893] [2025-03-17 11:12:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:08,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:08,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:08,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:08,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1105 [2025-03-17 11:12:08,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1043 transitions, 2096 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-17 11:12:08,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:08,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1105 [2025-03-17 11:12:08,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:08,906 INFO L124 PetriNetUnfolderBase]: 92/1872 cut-off events. [2025-03-17 11:12:08,906 INFO L125 PetriNetUnfolderBase]: For 11/37 co-relation queries the response was YES. [2025-03-17 11:12:08,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1872 events. 92/1872 cut-off events. For 11/37 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 10126 event pairs, 4 based on Foata normal form. 0/1511 useless extension candidates. Maximal degree in co-relation 1724. Up to 43 conditions per place. [2025-03-17 11:12:08,967 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2025-03-17 11:12:08,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1044 transitions, 2136 flow [2025-03-17 11:12:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2025-03-17 11:12:08,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731523378582202 [2025-03-17 11:12:08,970 INFO L175 Difference]: Start difference. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand 3 states and 3226 transitions. [2025-03-17 11:12:08,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1044 transitions, 2136 flow [2025-03-17 11:12:08,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1044 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:08,978 INFO L231 Difference]: Finished difference. Result has 1010 places, 1042 transitions, 2094 flow [2025-03-17 11:12:08,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=1010, PETRI_TRANSITIONS=1042} [2025-03-17 11:12:08,979 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -26 predicate places. [2025-03-17 11:12:08,979 INFO L471 AbstractCegarLoop]: Abstraction has has 1010 places, 1042 transitions, 2094 flow [2025-03-17 11:12:08,980 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-17 11:12:08,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:08,980 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-17 11:12:08,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:12:08,980 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:08,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1276364064, now seen corresponding path program 1 times [2025-03-17 11:12:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:08,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-03-17 11:12:08,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:08,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-17 11:12:08,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-17 11:12:08,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:08,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:09,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-17 11:12:09,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:09,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-03-17 11:12:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700576969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257196656] [2025-03-17 11:12:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:09,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:09,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:09,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1105 [2025-03-17 11:12:09,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:09,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:09,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1105 [2025-03-17 11:12:09,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:10,736 INFO L124 PetriNetUnfolderBase]: 441/6237 cut-off events. [2025-03-17 11:12:10,736 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-17 11:12:10,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6608 conditions, 6237 events. 441/6237 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 51306 event pairs, 110 based on Foata normal form. 0/4991 useless extension candidates. Maximal degree in co-relation 6094. Up to 339 conditions per place. [2025-03-17 11:12:10,916 INFO L140 encePairwiseOnDemand]: 1093/1105 looper letters, 29 selfloop transitions, 2 changer transitions 0/1036 dead transitions. [2025-03-17 11:12:10,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1036 transitions, 2146 flow [2025-03-17 11:12:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-03-17 11:12:10,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616892911010558 [2025-03-17 11:12:10,922 INFO L175 Difference]: Start difference. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand 3 states and 3188 transitions. [2025-03-17 11:12:10,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1036 transitions, 2146 flow [2025-03-17 11:12:10,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1036 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:10,947 INFO L231 Difference]: Finished difference. Result has 1001 places, 1034 transitions, 2084 flow [2025-03-17 11:12:10,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=1001, PETRI_TRANSITIONS=1034} [2025-03-17 11:12:10,955 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -35 predicate places. [2025-03-17 11:12:10,955 INFO L471 AbstractCegarLoop]: Abstraction has has 1001 places, 1034 transitions, 2084 flow [2025-03-17 11:12:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:10,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:10,956 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-17 11:12:10,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:12:10,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:10,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1774711071, now seen corresponding path program 1 times [2025-03-17 11:12:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407033061] [2025-03-17 11:12:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:10,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-17 11:12:10,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-17 11:12:10,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:10,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:11,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407033061] [2025-03-17 11:12:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407033061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:11,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506939879] [2025-03-17 11:12:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:11,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:11,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:11,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:11,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1105 [2025-03-17 11:12:11,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:11,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:11,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1105 [2025-03-17 11:12:11,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:13,453 INFO L124 PetriNetUnfolderBase]: 859/10615 cut-off events. [2025-03-17 11:12:13,454 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 11:12:13,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11421 conditions, 10615 events. 859/10615 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 101505 event pairs, 190 based on Foata normal form. 0/8539 useless extension candidates. Maximal degree in co-relation 10945. Up to 660 conditions per place. [2025-03-17 11:12:13,730 INFO L140 encePairwiseOnDemand]: 1093/1105 looper letters, 29 selfloop transitions, 2 changer transitions 0/1028 dead transitions. [2025-03-17 11:12:13,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1028 transitions, 2136 flow [2025-03-17 11:12:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-03-17 11:12:13,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616892911010558 [2025-03-17 11:12:13,733 INFO L175 Difference]: Start difference. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand 3 states and 3188 transitions. [2025-03-17 11:12:13,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1028 transitions, 2136 flow [2025-03-17 11:12:13,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1028 transitions, 2136 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:13,743 INFO L231 Difference]: Finished difference. Result has 994 places, 1026 transitions, 2078 flow [2025-03-17 11:12:13,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1026} [2025-03-17 11:12:13,744 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2025-03-17 11:12:13,744 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1026 transitions, 2078 flow [2025-03-17 11:12:13,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:13,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:13,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:13,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:12:13,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash -734948479, now seen corresponding path program 1 times [2025-03-17 11:12:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449622044] [2025-03-17 11:12:13,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:13,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 11:12:13,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 11:12:13,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:13,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449622044] [2025-03-17 11:12:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449622044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:13,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493283108] [2025-03-17 11:12:13,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:13,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:13,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:12:13,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1026 transitions, 2078 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-17 11:12:13,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:13,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:12:13,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:14,429 INFO L124 PetriNetUnfolderBase]: 167/2867 cut-off events. [2025-03-17 11:12:14,429 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-03-17 11:12:14,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 2867 events. 167/2867 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20449 event pairs, 26 based on Foata normal form. 0/2338 useless extension candidates. Maximal degree in co-relation 2301. Up to 106 conditions per place. [2025-03-17 11:12:14,533 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 2 changer transitions 0/1027 dead transitions. [2025-03-17 11:12:14,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1027 transitions, 2130 flow [2025-03-17 11:12:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2025-03-17 11:12:14,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695324283559578 [2025-03-17 11:12:14,535 INFO L175 Difference]: Start difference. First operand has 994 places, 1026 transitions, 2078 flow. Second operand 3 states and 3214 transitions. [2025-03-17 11:12:14,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1027 transitions, 2130 flow [2025-03-17 11:12:14,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1027 transitions, 2130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:14,544 INFO L231 Difference]: Finished difference. Result has 995 places, 1025 transitions, 2080 flow [2025-03-17 11:12:14,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=995, PETRI_TRANSITIONS=1025} [2025-03-17 11:12:14,545 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -41 predicate places. [2025-03-17 11:12:14,545 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1025 transitions, 2080 flow [2025-03-17 11:12:14,546 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-17 11:12:14,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:14,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:14,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:12:14,546 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:14,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash 508100499, now seen corresponding path program 1 times [2025-03-17 11:12:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:14,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782163896] [2025-03-17 11:12:14,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:14,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 11:12:14,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 11:12:14,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:14,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782163896] [2025-03-17 11:12:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782163896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015589922] [2025-03-17 11:12:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:14,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:14,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:14,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:14,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1105 [2025-03-17 11:12:14,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1025 transitions, 2080 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-17 11:12:14,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:14,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1105 [2025-03-17 11:12:14,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:14,980 INFO L124 PetriNetUnfolderBase]: 106/2076 cut-off events. [2025-03-17 11:12:14,980 INFO L125 PetriNetUnfolderBase]: For 21/44 co-relation queries the response was YES. [2025-03-17 11:12:15,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 2076 events. 106/2076 cut-off events. For 21/44 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11727 event pairs, 4 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 1930. Up to 48 conditions per place. [2025-03-17 11:12:15,047 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1026 dead transitions. [2025-03-17 11:12:15,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1026 transitions, 2120 flow [2025-03-17 11:12:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2025-03-17 11:12:15,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731523378582202 [2025-03-17 11:12:15,099 INFO L175 Difference]: Start difference. First operand has 995 places, 1025 transitions, 2080 flow. Second operand 3 states and 3226 transitions. [2025-03-17 11:12:15,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1026 transitions, 2120 flow [2025-03-17 11:12:15,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1026 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:15,107 INFO L231 Difference]: Finished difference. Result has 994 places, 1024 transitions, 2078 flow [2025-03-17 11:12:15,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1024} [2025-03-17 11:12:15,108 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2025-03-17 11:12:15,108 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1024 transitions, 2078 flow [2025-03-17 11:12:15,109 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-17 11:12:15,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:15,109 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-17 11:12:15,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:12:15,109 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:15,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 632076307, now seen corresponding path program 1 times [2025-03-17 11:12:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106653639] [2025-03-17 11:12:15,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:15,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 11:12:15,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 11:12:15,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:15,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:15,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106653639] [2025-03-17 11:12:15,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106653639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731771070] [2025-03-17 11:12:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:15,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:15,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:15,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:15,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1105 [2025-03-17 11:12:15,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1024 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:15,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:15,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1105 [2025-03-17 11:12:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:15,947 INFO L124 PetriNetUnfolderBase]: 192/3769 cut-off events. [2025-03-17 11:12:15,947 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:12:16,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 3769 events. 192/3769 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25672 event pairs, 8 based on Foata normal form. 0/3078 useless extension candidates. Maximal degree in co-relation 3434. Up to 42 conditions per place. [2025-03-17 11:12:16,070 INFO L140 encePairwiseOnDemand]: 1091/1105 looper letters, 18 selfloop transitions, 9 changer transitions 0/1025 dead transitions. [2025-03-17 11:12:16,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 1025 transitions, 2136 flow [2025-03-17 11:12:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2025-03-17 11:12:16,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689291101055807 [2025-03-17 11:12:16,072 INFO L175 Difference]: Start difference. First operand has 994 places, 1024 transitions, 2078 flow. Second operand 3 states and 3212 transitions. [2025-03-17 11:12:16,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 1025 transitions, 2136 flow [2025-03-17 11:12:16,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 1025 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:16,081 INFO L231 Difference]: Finished difference. Result has 990 places, 1023 transitions, 2107 flow [2025-03-17 11:12:16,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=990, PETRI_TRANSITIONS=1023} [2025-03-17 11:12:16,082 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -46 predicate places. [2025-03-17 11:12:16,082 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1023 transitions, 2107 flow [2025-03-17 11:12:16,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:16,083 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-17 11:12:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:12:16,083 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:16,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1661797216, now seen corresponding path program 1 times [2025-03-17 11:12:16,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:16,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419953978] [2025-03-17 11:12:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:16,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:12:16,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:12:16,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:16,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:16,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:16,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419953978] [2025-03-17 11:12:16,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419953978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:16,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:16,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:16,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868967641] [2025-03-17 11:12:16,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:16,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:16,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:16,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:16,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1105 [2025-03-17 11:12:16,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1023 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:16,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:16,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1105 [2025-03-17 11:12:16,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:19,659 INFO L124 PetriNetUnfolderBase]: 1569/19951 cut-off events. [2025-03-17 11:12:19,660 INFO L125 PetriNetUnfolderBase]: For 147/153 co-relation queries the response was YES. [2025-03-17 11:12:19,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21197 conditions, 19951 events. 1569/19951 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 223390 event pairs, 488 based on Foata normal form. 0/16094 useless extension candidates. Maximal degree in co-relation 16212. Up to 1183 conditions per place. [2025-03-17 11:12:20,055 INFO L140 encePairwiseOnDemand]: 1093/1105 looper letters, 29 selfloop transitions, 2 changer transitions 0/1017 dead transitions. [2025-03-17 11:12:20,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1017 transitions, 2159 flow [2025-03-17 11:12:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2025-03-17 11:12:20,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9616892911010558 [2025-03-17 11:12:20,058 INFO L175 Difference]: Start difference. First operand has 990 places, 1023 transitions, 2107 flow. Second operand 3 states and 3188 transitions. [2025-03-17 11:12:20,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 1017 transitions, 2159 flow [2025-03-17 11:12:20,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2150 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:20,067 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2092 flow [2025-03-17 11:12:20,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2025-03-17 11:12:20,068 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -54 predicate places. [2025-03-17 11:12:20,068 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2092 flow [2025-03-17 11:12:20,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:20,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:20,069 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-17 11:12:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:12:20,069 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:20,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1021238375, now seen corresponding path program 1 times [2025-03-17 11:12:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:20,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47027393] [2025-03-17 11:12:20,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:20,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:12:20,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:12:20,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:20,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:20,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:20,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47027393] [2025-03-17 11:12:20,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47027393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:20,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029014885] [2025-03-17 11:12:20,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:20,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:20,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:20,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:20,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:20,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1105 [2025-03-17 11:12:20,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:20,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:20,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1105 [2025-03-17 11:12:20,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:21,205 INFO L124 PetriNetUnfolderBase]: 262/5102 cut-off events. [2025-03-17 11:12:21,206 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2025-03-17 11:12:21,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5302 conditions, 5102 events. 262/5102 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 44386 event pairs, 20 based on Foata normal form. 1/4212 useless extension candidates. Maximal degree in co-relation 4576. Up to 68 conditions per place. [2025-03-17 11:12:21,283 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2025-03-17 11:12:21,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2146 flow [2025-03-17 11:12:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2025-03-17 11:12:21,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971342383107089 [2025-03-17 11:12:21,285 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2092 flow. Second operand 3 states and 3220 transitions. [2025-03-17 11:12:21,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2146 flow [2025-03-17 11:12:21,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1016 transitions, 2146 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:12:21,294 INFO L231 Difference]: Finished difference. Result has 983 places, 1014 transitions, 2096 flow [2025-03-17 11:12:21,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=981, 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=2096, PETRI_PLACES=983, PETRI_TRANSITIONS=1014} [2025-03-17 11:12:21,296 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -53 predicate places. [2025-03-17 11:12:21,296 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 1014 transitions, 2096 flow [2025-03-17 11:12:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:21,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:21,297 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-17 11:12:21,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:12:21,297 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:21,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1222279101, now seen corresponding path program 1 times [2025-03-17 11:12:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:21,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-03-17 11:12:21,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:21,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 11:12:21,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 11:12:21,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:21,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760485467] [2025-03-17 11:12:21,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760485467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:21,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65997744] [2025-03-17 11:12:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:21,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:21,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:21,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:21,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:12:21,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1014 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:21,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:21,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:12:21,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:21,967 INFO L124 PetriNetUnfolderBase]: 181/3054 cut-off events. [2025-03-17 11:12:21,967 INFO L125 PetriNetUnfolderBase]: For 46/58 co-relation queries the response was YES. [2025-03-17 11:12:22,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 3054 events. 181/3054 cut-off events. For 46/58 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22199 event pairs, 37 based on Foata normal form. 1/2533 useless extension candidates. Maximal degree in co-relation 2512. Up to 139 conditions per place. [2025-03-17 11:12:22,049 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 2 changer transitions 0/1015 dead transitions. [2025-03-17 11:12:22,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1015 transitions, 2148 flow [2025-03-17 11:12:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2025-03-17 11:12:22,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695324283559578 [2025-03-17 11:12:22,051 INFO L175 Difference]: Start difference. First operand has 983 places, 1014 transitions, 2096 flow. Second operand 3 states and 3214 transitions. [2025-03-17 11:12:22,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1015 transitions, 2148 flow [2025-03-17 11:12:22,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1015 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:22,061 INFO L231 Difference]: Finished difference. Result has 982 places, 1013 transitions, 2092 flow [2025-03-17 11:12:22,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=982, PETRI_TRANSITIONS=1013} [2025-03-17 11:12:22,063 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -54 predicate places. [2025-03-17 11:12:22,063 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1013 transitions, 2092 flow [2025-03-17 11:12:22,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:22,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:22,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:22,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:12:22,064 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1484705367, now seen corresponding path program 1 times [2025-03-17 11:12:22,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:22,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-03-17 11:12:22,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:22,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:22,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 11:12:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 11:12:22,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:22,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-03-17 11:12:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135042885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:22,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198577058] [2025-03-17 11:12:22,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:22,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:22,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:22,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:22,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1105 [2025-03-17 11:12:22,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1013 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:22,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:22,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1105 [2025-03-17 11:12:22,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:23,146 INFO L124 PetriNetUnfolderBase]: 298/5501 cut-off events. [2025-03-17 11:12:23,146 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-03-17 11:12:23,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 5501 events. 298/5501 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 45036 event pairs, 15 based on Foata normal form. 0/4550 useless extension candidates. Maximal degree in co-relation 5383. Up to 66 conditions per place. [2025-03-17 11:12:23,273 INFO L140 encePairwiseOnDemand]: 1091/1105 looper letters, 18 selfloop transitions, 9 changer transitions 0/1014 dead transitions. [2025-03-17 11:12:23,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1014 transitions, 2150 flow [2025-03-17 11:12:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2025-03-17 11:12:23,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689291101055807 [2025-03-17 11:12:23,276 INFO L175 Difference]: Start difference. First operand has 982 places, 1013 transitions, 2092 flow. Second operand 3 states and 3212 transitions. [2025-03-17 11:12:23,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1014 transitions, 2150 flow [2025-03-17 11:12:23,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 1014 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:23,285 INFO L231 Difference]: Finished difference. Result has 978 places, 1012 transitions, 2121 flow [2025-03-17 11:12:23,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=978, PETRI_TRANSITIONS=1012} [2025-03-17 11:12:23,286 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2025-03-17 11:12:23,286 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1012 transitions, 2121 flow [2025-03-17 11:12:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:23,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:23,287 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-17 11:12:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:12:23,287 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1311496826, now seen corresponding path program 1 times [2025-03-17 11:12:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-03-17 11:12:23,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:23,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-17 11:12:23,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-17 11:12:23,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-03-17 11:12:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909899214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:23,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:23,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992821713] [2025-03-17 11:12:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:23,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:23,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:23,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:23,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1105 [2025-03-17 11:12:23,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1012 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:23,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:23,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1105 [2025-03-17 11:12:23,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:24,311 INFO L124 PetriNetUnfolderBase]: 285/5369 cut-off events. [2025-03-17 11:12:24,311 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2025-03-17 11:12:24,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 5369 events. 285/5369 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 47723 event pairs, 30 based on Foata normal form. 0/4449 useless extension candidates. Maximal degree in co-relation 5079. Up to 104 conditions per place. [2025-03-17 11:12:24,409 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 22 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2025-03-17 11:12:24,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1013 transitions, 2175 flow [2025-03-17 11:12:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2025-03-17 11:12:24,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971342383107089 [2025-03-17 11:12:24,411 INFO L175 Difference]: Start difference. First operand has 978 places, 1012 transitions, 2121 flow. Second operand 3 states and 3220 transitions. [2025-03-17 11:12:24,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1013 transitions, 2175 flow [2025-03-17 11:12:24,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1013 transitions, 2166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:24,420 INFO L231 Difference]: Finished difference. Result has 978 places, 1011 transitions, 2116 flow [2025-03-17 11:12:24,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=978, PETRI_TRANSITIONS=1011} [2025-03-17 11:12:24,426 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2025-03-17 11:12:24,426 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1011 transitions, 2116 flow [2025-03-17 11:12:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:24,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:24,426 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-17 11:12:24,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:12:24,427 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:24,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1455144037, now seen corresponding path program 1 times [2025-03-17 11:12:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:24,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-03-17 11:12:24,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:24,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 11:12:24,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 11:12:24,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:24,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500049683] [2025-03-17 11:12:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500049683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:24,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:24,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117353792] [2025-03-17 11:12:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:24,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:24,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:24,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:24,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1105 [2025-03-17 11:12:24,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1011 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:24,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:24,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1105 [2025-03-17 11:12:24,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:25,044 INFO L124 PetriNetUnfolderBase]: 174/3094 cut-off events. [2025-03-17 11:12:25,045 INFO L125 PetriNetUnfolderBase]: For 43/50 co-relation queries the response was YES. [2025-03-17 11:12:25,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 3094 events. 174/3094 cut-off events. For 43/50 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22110 event pairs, 12 based on Foata normal form. 3/2619 useless extension candidates. Maximal degree in co-relation 2572. Up to 90 conditions per place. [2025-03-17 11:12:25,126 INFO L140 encePairwiseOnDemand]: 1091/1105 looper letters, 16 selfloop transitions, 8 changer transitions 12/1012 dead transitions. [2025-03-17 11:12:25,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 1012 transitions, 2172 flow [2025-03-17 11:12:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-17 11:12:25,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9686274509803922 [2025-03-17 11:12:25,129 INFO L175 Difference]: Start difference. First operand has 978 places, 1011 transitions, 2116 flow. Second operand 3 states and 3211 transitions. [2025-03-17 11:12:25,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 1012 transitions, 2172 flow [2025-03-17 11:12:25,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 1012 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:25,139 INFO L231 Difference]: Finished difference. Result has 974 places, 998 transitions, 2111 flow [2025-03-17 11:12:25,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1006, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=974, PETRI_TRANSITIONS=998} [2025-03-17 11:12:25,140 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -62 predicate places. [2025-03-17 11:12:25,140 INFO L471 AbstractCegarLoop]: Abstraction has has 974 places, 998 transitions, 2111 flow [2025-03-17 11:12:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:25,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:25,141 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-17 11:12:25,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:12:25,141 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:25,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1037083070, now seen corresponding path program 1 times [2025-03-17 11:12:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346865143] [2025-03-17 11:12:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:25,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 11:12:25,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 11:12:25,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:25,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:25,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:25,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346865143] [2025-03-17 11:12:25,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346865143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:25,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:25,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:25,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392568760] [2025-03-17 11:12:25,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:25,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:25,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:25,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:25,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:25,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1105 [2025-03-17 11:12:25,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 998 transitions, 2111 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-17 11:12:25,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:25,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1105 [2025-03-17 11:12:25,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:26,212 INFO L124 PetriNetUnfolderBase]: 215/4625 cut-off events. [2025-03-17 11:12:26,212 INFO L125 PetriNetUnfolderBase]: For 40/50 co-relation queries the response was YES. [2025-03-17 11:12:26,316 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 39027 event pairs, 4 based on Foata normal form. 1/3901 useless extension candidates. Maximal degree in co-relation 4558. Up to 73 conditions per place. [2025-03-17 11:12:26,355 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 16 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2025-03-17 11:12:26,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 1003 transitions, 2161 flow [2025-03-17 11:12:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-17 11:12:26,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975867269984917 [2025-03-17 11:12:26,357 INFO L175 Difference]: Start difference. First operand has 974 places, 998 transitions, 2111 flow. Second operand 3 states and 3235 transitions. [2025-03-17 11:12:26,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 1003 transitions, 2161 flow [2025-03-17 11:12:26,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 1003 transitions, 2153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:26,367 INFO L231 Difference]: Finished difference. Result has 966 places, 999 transitions, 2117 flow [2025-03-17 11:12:26,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:26,368 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -70 predicate places. [2025-03-17 11:12:26,368 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 999 transitions, 2117 flow [2025-03-17 11:12:26,368 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-17 11:12:26,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:26,368 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-17 11:12:26,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:12:26,368 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:26,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:26,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2103473029, now seen corresponding path program 1 times [2025-03-17 11:12:26,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:26,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516031246] [2025-03-17 11:12:26,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:26,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 11:12:26,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 11:12:26,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:26,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516031246] [2025-03-17 11:12:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516031246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:26,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173838101] [2025-03-17 11:12:26,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:26,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:26,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:26,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1105 [2025-03-17 11:12:26,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 999 transitions, 2117 flow. Second operand has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:26,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:26,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1105 [2025-03-17 11:12:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:28,146 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2025-03-17 11:12:28,147 INFO L125 PetriNetUnfolderBase]: For 6/42 co-relation queries the response was YES. [2025-03-17 11:12:28,316 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 72. Compared 83191 event pairs, 14 based on Foata normal form. 2/7653 useless extension candidates. Maximal degree in co-relation 8206. Up to 166 conditions per place. [2025-03-17 11:12:28,383 INFO L140 encePairwiseOnDemand]: 1088/1105 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-03-17 11:12:28,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2179 flow [2025-03-17 11:12:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-03-17 11:12:28,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9631975867269985 [2025-03-17 11:12:28,386 INFO L175 Difference]: Start difference. First operand has 966 places, 999 transitions, 2117 flow. Second operand 3 states and 3193 transitions. [2025-03-17 11:12:28,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2179 flow [2025-03-17 11:12:28,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:28,398 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2025-03-17 11:12:28,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:28,399 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2025-03-17 11:12:28,399 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2025-03-17 11:12:28,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:28,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:28,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] [2025-03-17 11:12:28,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:12:28,400 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:28,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1064240063, now seen corresponding path program 1 times [2025-03-17 11:12:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481401114] [2025-03-17 11:12:28,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:28,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:28,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:12:28,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:12:28,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:28,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481401114] [2025-03-17 11:12:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481401114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:28,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736612973] [2025-03-17 11:12:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:28,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:28,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:28,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:28,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1105 [2025-03-17 11:12:28,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 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-17 11:12:28,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:28,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1105 [2025-03-17 11:12:28,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:29,371 INFO L124 PetriNetUnfolderBase]: 259/4215 cut-off events. [2025-03-17 11:12:29,371 INFO L125 PetriNetUnfolderBase]: For 202/224 co-relation queries the response was YES. [2025-03-17 11:12:29,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 4215 events. 259/4215 cut-off events. For 202/224 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 33642 event pairs, 60 based on Foata normal form. 1/3547 useless extension candidates. Maximal degree in co-relation 3938. Up to 212 conditions per place. [2025-03-17 11:12:29,513 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 20 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-03-17 11:12:29,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2201 flow [2025-03-17 11:12:29,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3218 transitions. [2025-03-17 11:12:29,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707390648567119 [2025-03-17 11:12:29,516 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3218 transitions. [2025-03-17 11:12:29,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2201 flow [2025-03-17 11:12:29,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:29,525 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2025-03-17 11:12:29,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:29,526 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -76 predicate places. [2025-03-17 11:12:29,526 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2025-03-17 11:12:29,526 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-17 11:12:29,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:29,526 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-17 11:12:29,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 11:12:29,527 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:29,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2014600304, now seen corresponding path program 1 times [2025-03-17 11:12:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:29,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508659703] [2025-03-17 11:12:29,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:29,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:29,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:12:29,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:12:29,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:29,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:29,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-17 11:12:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508659703] [2025-03-17 11:12:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508659703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:29,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212747232] [2025-03-17 11:12:29,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:29,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:29,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:12:29,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 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-17 11:12:29,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:29,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:12:29,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:31,042 INFO L124 PetriNetUnfolderBase]: 367/7045 cut-off events. [2025-03-17 11:12:31,042 INFO L125 PetriNetUnfolderBase]: For 97/135 co-relation queries the response was YES. [2025-03-17 11:12:31,199 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 87. Compared 68037 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-17 11:12:31,257 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 24 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2025-03-17 11:12:31,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2195 flow [2025-03-17 11:12:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-17 11:12:31,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-17 11:12:31,259 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3213 transitions. [2025-03-17 11:12:31,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2195 flow [2025-03-17 11:12:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:31,269 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2025-03-17 11:12:31,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:31,270 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -77 predicate places. [2025-03-17 11:12:31,270 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2025-03-17 11:12:31,270 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-17 11:12:31,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:31,270 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-17 11:12:31,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 11:12:31,270 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:31,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 216130068, now seen corresponding path program 1 times [2025-03-17 11:12:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:31,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861454323] [2025-03-17 11:12:31,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:31,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 11:12:31,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 11:12:31,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:31,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861454323] [2025-03-17 11:12:31,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861454323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:31,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:31,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240490926] [2025-03-17 11:12:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:31,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:31,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:31,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1105 [2025-03-17 11:12:31,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:31,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:31,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1105 [2025-03-17 11:12:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:32,954 INFO L124 PetriNetUnfolderBase]: 267/5679 cut-off events. [2025-03-17 11:12:32,954 INFO L125 PetriNetUnfolderBase]: For 14/70 co-relation queries the response was YES. [2025-03-17 11:12:33,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 5679 events. 267/5679 cut-off events. For 14/70 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 50501 event pairs, 10 based on Foata normal form. 0/4793 useless extension candidates. Maximal degree in co-relation 4921. Up to 89 conditions per place. [2025-03-17 11:12:33,116 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2025-03-17 11:12:33,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2025-03-17 11:12:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3234 transitions. [2025-03-17 11:12:33,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9755656108597285 [2025-03-17 11:12:33,118 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3234 transitions. [2025-03-17 11:12:33,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2025-03-17 11:12:33,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:33,126 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2025-03-17 11:12:33,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:33,127 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2025-03-17 11:12:33,128 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2025-03-17 11:12:33,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:33,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:33,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:12:33,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 11:12:33,128 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:33,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:33,129 INFO L85 PathProgramCache]: Analyzing trace with hash -765316623, now seen corresponding path program 1 times [2025-03-17 11:12:33,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650219963] [2025-03-17 11:12:33,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:33,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:12:33,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:12:33,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:33,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650219963] [2025-03-17 11:12:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650219963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:33,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:33,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438878372] [2025-03-17 11:12:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:33,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:33,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:33,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:33,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1105 [2025-03-17 11:12:33,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:33,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:33,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1105 [2025-03-17 11:12:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:36,790 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2025-03-17 11:12:36,791 INFO L125 PetriNetUnfolderBase]: For 84/224 co-relation queries the response was YES. [2025-03-17 11:12:37,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 10693 events. 631/10693 cut-off events. For 84/224 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 110419 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9698. Up to 336 conditions per place. [2025-03-17 11:12:37,169 INFO L140 encePairwiseOnDemand]: 1088/1105 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2025-03-17 11:12:37,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2025-03-17 11:12:37,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-03-17 11:12:37,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9631975867269985 [2025-03-17 11:12:37,172 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3193 transitions. [2025-03-17 11:12:37,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2025-03-17 11:12:37,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:37,183 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2025-03-17 11:12:37,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:37,184 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -80 predicate places. [2025-03-17 11:12:37,184 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2025-03-17 11:12:37,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:37,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:37,185 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-17 11:12:37,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 11:12:37,185 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:37,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 547776207, now seen corresponding path program 1 times [2025-03-17 11:12:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:37,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667157924] [2025-03-17 11:12:37,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:37,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 11:12:37,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 11:12:37,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667157924] [2025-03-17 11:12:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667157924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328417688] [2025-03-17 11:12:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:37,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:37,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:12:37,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:37,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:37,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:12:37,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:40,218 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2025-03-17 11:12:40,219 INFO L125 PetriNetUnfolderBase]: For 386/624 co-relation queries the response was YES. [2025-03-17 11:12:40,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 8694 events. 484/8694 cut-off events. For 386/624 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 92292 event pairs, 95 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7926. Up to 284 conditions per place. [2025-03-17 11:12:40,509 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2025-03-17 11:12:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2025-03-17 11:12:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-17 11:12:40,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-17 11:12:40,510 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3213 transitions. [2025-03-17 11:12:40,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2025-03-17 11:12:40,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:40,520 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2025-03-17 11:12:40,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:40,521 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -81 predicate places. [2025-03-17 11:12:40,521 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2025-03-17 11:12:40,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:40,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:40,522 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-17 11:12:40,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 11:12:40,522 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -957202214, now seen corresponding path program 1 times [2025-03-17 11:12:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030585542] [2025-03-17 11:12:40,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:40,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 11:12:40,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 11:12:40,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:40,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:40,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030585542] [2025-03-17 11:12:40,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030585542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:40,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:40,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347886169] [2025-03-17 11:12:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:40,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:40,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:40,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:40,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1105 [2025-03-17 11:12:40,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:40,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:40,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1105 [2025-03-17 11:12:40,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:42,065 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2025-03-17 11:12:42,066 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-03-17 11:12:42,202 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 48318 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-17 11:12:42,248 INFO L140 encePairwiseOnDemand]: 1098/1105 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2025-03-17 11:12:42,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2025-03-17 11:12:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2025-03-17 11:12:42,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704374057315234 [2025-03-17 11:12:42,249 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3217 transitions. [2025-03-17 11:12:42,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2025-03-17 11:12:42,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:42,257 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2025-03-17 11:12:42,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:42,258 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -85 predicate places. [2025-03-17 11:12:42,258 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2025-03-17 11:12:42,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:42,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:42,259 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-17 11:12:42,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 11:12:42,259 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:42,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash 993700496, now seen corresponding path program 1 times [2025-03-17 11:12:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-03-17 11:12:42,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:42,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 11:12:42,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 11:12:42,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595382007] [2025-03-17 11:12:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595382007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:12:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307550233] [2025-03-17 11:12:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:42,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:42,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:42,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1105 [2025-03-17 11:12:42,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:42,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:42,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1105 [2025-03-17 11:12:42,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:44,798 INFO L124 PetriNetUnfolderBase]: 386/8361 cut-off events. [2025-03-17 11:12:44,798 INFO L125 PetriNetUnfolderBase]: For 34/66 co-relation queries the response was YES. [2025-03-17 11:12:45,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 8361 events. 386/8361 cut-off events. For 34/66 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 76251 event pairs, 24 based on Foata normal form. 2/7038 useless extension candidates. Maximal degree in co-relation 7682. Up to 175 conditions per place. [2025-03-17 11:12:45,208 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2025-03-17 11:12:45,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2025-03-17 11:12:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2025-03-17 11:12:45,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.97526395173454 [2025-03-17 11:12:45,210 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3233 transitions. [2025-03-17 11:12:45,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2025-03-17 11:12:45,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:45,220 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2025-03-17 11:12:45,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:45,221 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -83 predicate places. [2025-03-17 11:12:45,221 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2025-03-17 11:12:45,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:45,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:45,223 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-17 11:12:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 11:12:45,223 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:45,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash -844435955, now seen corresponding path program 1 times [2025-03-17 11:12:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408536946] [2025-03-17 11:12:45,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:45,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 11:12:45,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 11:12:45,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:45,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:45,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408536946] [2025-03-17 11:12:45,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408536946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:45,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:45,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012129898] [2025-03-17 11:12:45,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:45,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:45,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:45,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:45,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1105 [2025-03-17 11:12:45,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:45,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:45,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1105 [2025-03-17 11:12:45,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:48,314 INFO L124 PetriNetUnfolderBase]: 702/10384 cut-off events. [2025-03-17 11:12:48,315 INFO L125 PetriNetUnfolderBase]: For 326/386 co-relation queries the response was YES. [2025-03-17 11:12:48,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11899 conditions, 10384 events. 702/10384 cut-off events. For 326/386 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 116064 event pairs, 54 based on Foata normal form. 2/8868 useless extension candidates. Maximal degree in co-relation 10283. Up to 682 conditions per place. [2025-03-17 11:12:48,846 INFO L140 encePairwiseOnDemand]: 1088/1105 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2025-03-17 11:12:48,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2025-03-17 11:12:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2025-03-17 11:12:48,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9631975867269985 [2025-03-17 11:12:48,848 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3193 transitions. [2025-03-17 11:12:48,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2025-03-17 11:12:48,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:12:48,858 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2025-03-17 11:12:48,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:48,859 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -88 predicate places. [2025-03-17 11:12:48,859 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2025-03-17 11:12:48,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:48,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:48,859 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-17 11:12:48,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-17 11:12:48,859 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:48,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1904922808, now seen corresponding path program 1 times [2025-03-17 11:12:48,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:48,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288596693] [2025-03-17 11:12:48,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:48,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 11:12:48,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 11:12:48,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:48,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:48,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288596693] [2025-03-17 11:12:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288596693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:48,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215516004] [2025-03-17 11:12:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:48,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:48,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:48,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:48,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1105 [2025-03-17 11:12:48,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:48,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:48,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1105 [2025-03-17 11:12:48,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:51,998 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2025-03-17 11:12:51,999 INFO L125 PetriNetUnfolderBase]: For 904/972 co-relation queries the response was YES. [2025-03-17 11:12:52,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 904/972 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 112712 event pairs, 190 based on Foata normal form. 2/8814 useless extension candidates. Maximal degree in co-relation 10447. Up to 585 conditions per place. [2025-03-17 11:12:52,507 INFO L140 encePairwiseOnDemand]: 1102/1105 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2025-03-17 11:12:52,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2025-03-17 11:12:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2025-03-17 11:12:52,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2025-03-17 11:12:52,508 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3213 transitions. [2025-03-17 11:12:52,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2025-03-17 11:12:52,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:52,520 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2025-03-17 11:12:52,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:52,521 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -89 predicate places. [2025-03-17 11:12:52,521 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2025-03-17 11:12:52,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:52,522 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-17 11:12:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-17 11:12:52,522 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -76343623, now seen corresponding path program 1 times [2025-03-17 11:12:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648346970] [2025-03-17 11:12:52,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:52,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 11:12:52,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 11:12:52,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:52,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:12:52,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:52,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648346970] [2025-03-17 11:12:52,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648346970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:52,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:52,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314464369] [2025-03-17 11:12:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:52,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:52,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:52,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:52,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:52,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1105 [2025-03-17 11:12:52,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:52,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:52,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1105 [2025-03-17 11:12:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:12:55,621 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2025-03-17 11:12:55,621 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-03-17 11:12:55,986 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 124. Compared 92229 event pairs, 11 based on Foata normal form. 1/7732 useless extension candidates. Maximal degree in co-relation 8449. Up to 204 conditions per place. [2025-03-17 11:12:56,113 INFO L140 encePairwiseOnDemand]: 1098/1105 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2025-03-17 11:12:56,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2025-03-17 11:12:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:12:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:12:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2025-03-17 11:12:56,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9704374057315234 [2025-03-17 11:12:56,115 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3217 transitions. [2025-03-17 11:12:56,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2025-03-17 11:12:56,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:12:56,125 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2025-03-17 11:12:56,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1105, 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-17 11:12:56,126 INFO L279 CegarLoopForPetriNet]: 1036 programPoint places, -93 predicate places. [2025-03-17 11:12:56,126 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2025-03-17 11:12:56,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:12:56,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:12:56,127 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-17 11:12:56,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-17 11:12:56,127 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2025-03-17 11:12:56,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:12:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash -518976612, now seen corresponding path program 1 times [2025-03-17 11:12:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:12:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389457866] [2025-03-17 11:12:56,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:12:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:12:56,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-17 11:12:56,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-17 11:12:56,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:12:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:12:56,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-17 11:12:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:12:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389457866] [2025-03-17 11:12:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389457866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:12:56,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:12:56,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:12:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135307998] [2025-03-17 11:12:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:12:56,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:12:56,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:12:56,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:12:56,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:12:56,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1105 [2025-03-17 11:12:56,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 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-17 11:12:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:12:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1105 [2025-03-17 11:12:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand