./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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-node-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:52:58,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:52:58,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:52:58,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:52:58,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:52:58,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:52:58,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:52:58,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:52:58,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:52:58,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:52:58,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:52:58,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:52:58,482 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:52:58,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:52:58,483 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:52:58,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:52:58,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:52:58,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:52:58,484 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-03-04 06:52:58,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:52:58,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:52:58,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:52:58,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:52:58,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:52:58,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-04 06:52:59,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491130a75/ce69d5e2563440da9c51266f86ff4da7/FLAG95a66e9cd [2025-03-04 06:53:00,217 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:53:00,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-04 06:53:00,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491130a75/ce69d5e2563440da9c51266f86ff4da7/FLAG95a66e9cd [2025-03-04 06:53:00,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491130a75/ce69d5e2563440da9c51266f86ff4da7 [2025-03-04 06:53:00,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:53:00,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:53:00,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:53:00,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:53:00,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:53:00,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3aa120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00, skipping insertion in model container [2025-03-04 06:53:00,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:53:00,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:53:00,455 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:53:00,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:53:00,512 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:53:00,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00 WrapperNode [2025-03-04 06:53:00,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:53:00,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:53:00,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:53:00,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:53:00,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,566 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 779 [2025-03-04 06:53:00,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:53:00,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:53:00,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:53:00,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:53:00,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:53:00,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:53:00,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:53:00,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:53:00,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (1/1) ... [2025-03-04 06:53:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:53:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:53:00,666 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-04 06:53:00,668 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-04 06:53:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:53:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:53:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:53:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:53:00,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:53:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:53:00,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:53:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:53:00,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:53:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:53:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:53:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:53:00,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:53:00,688 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:53:00,816 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:53:00,818 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:53:01,689 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:53:01,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:53:01,741 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:53:01,742 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:53:01,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:01 BoogieIcfgContainer [2025-03-04 06:53:01,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:53:01,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:53:01,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:53:01,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:53:01,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:53:00" (1/3) ... [2025-03-04 06:53:01,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2029e544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:53:01, skipping insertion in model container [2025-03-04 06:53:01,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:00" (2/3) ... [2025-03-04 06:53:01,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2029e544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:53:01, skipping insertion in model container [2025-03-04 06:53:01,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:01" (3/3) ... [2025-03-04 06:53:01,751 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-03-04 06:53:01,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:53:01,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 1007 locations, 1 initial locations, 6 loop locations, and 116 error locations. [2025-03-04 06:53:01,762 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:53:01,895 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:53:01,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1016 places, 1048 transitions, 2117 flow [2025-03-04 06:53:02,253 INFO L124 PetriNetUnfolderBase]: 42/1045 cut-off events. [2025-03-04 06:53:02,255 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:53:02,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 1045 events. 42/1045 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2265 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-04 06:53:02,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 1016 places, 1048 transitions, 2117 flow [2025-03-04 06:53:02,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 993 places, 1022 transitions, 2062 flow [2025-03-04 06:53:02,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:53:02,339 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;@489d42c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:53:02,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 194 error locations. [2025-03-04 06:53:02,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:53:02,346 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-04 06:53:02,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:53:02,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:02,347 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] [2025-03-04 06:53:02,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:02,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1810093037, now seen corresponding path program 1 times [2025-03-04 06:53:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:02,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112752556] [2025-03-04 06:53:02,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:02,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:02,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:53:02,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:53:02,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:02,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:02,516 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-04 06:53:02,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112752556] [2025-03-04 06:53:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112752556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:02,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:02,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:02,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219797632] [2025-03-04 06:53:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:02,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:02,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:02,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:02,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-03-04 06:53:02,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1022 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:02,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:02,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-03-04 06:53:02,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:03,242 INFO L124 PetriNetUnfolderBase]: 86/2508 cut-off events. [2025-03-04 06:53:03,243 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 06:53:03,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2508 events. 86/2508 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14467 event pairs, 39 based on Foata normal form. 62/2119 useless extension candidates. Maximal degree in co-relation 1937. Up to 89 conditions per place. [2025-03-04 06:53:03,294 INFO L140 encePairwiseOnDemand]: 1023/1048 looper letters, 19 selfloop transitions, 2 changer transitions 16/999 dead transitions. [2025-03-04 06:53:03,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 999 transitions, 2058 flow [2025-03-04 06:53:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3047 transitions. [2025-03-04 06:53:03,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969147582697201 [2025-03-04 06:53:03,321 INFO L175 Difference]: Start difference. First operand has 993 places, 1022 transitions, 2062 flow. Second operand 3 states and 3047 transitions. [2025-03-04 06:53:03,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 999 transitions, 2058 flow [2025-03-04 06:53:03,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 999 transitions, 2046 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:53:03,346 INFO L231 Difference]: Finished difference. Result has 988 places, 983 transitions, 1976 flow [2025-03-04 06:53:03,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1976, PETRI_PLACES=988, PETRI_TRANSITIONS=983} [2025-03-04 06:53:03,354 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -5 predicate places. [2025-03-04 06:53:03,355 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 983 transitions, 1976 flow [2025-03-04 06:53:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:03,356 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] [2025-03-04 06:53:03,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:53:03,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:03,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1772810165, now seen corresponding path program 1 times [2025-03-04 06:53:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:03,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787986711] [2025-03-04 06:53:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:03,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:53:03,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:53:03,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:03,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:03,429 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-04 06:53:03,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:03,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787986711] [2025-03-04 06:53:03,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787986711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:03,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:03,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72567331] [2025-03-04 06:53:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:03,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:03,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:03,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:03,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:03,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-03-04 06:53:03,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 983 transitions, 1976 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:03,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:03,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-03-04 06:53:03,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:04,259 INFO L124 PetriNetUnfolderBase]: 212/3960 cut-off events. [2025-03-04 06:53:04,259 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 06:53:04,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 3960 events. 212/3960 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 29703 event pairs, 132 based on Foata normal form. 0/3320 useless extension candidates. Maximal degree in co-relation 4237. Up to 257 conditions per place. [2025-03-04 06:53:04,340 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/973 dead transitions. [2025-03-04 06:53:04,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 973 transitions, 2010 flow [2025-03-04 06:53:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-03-04 06:53:04,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-03-04 06:53:04,346 INFO L175 Difference]: Start difference. First operand has 988 places, 983 transitions, 1976 flow. Second operand 3 states and 2998 transitions. [2025-03-04 06:53:04,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 973 transitions, 2010 flow [2025-03-04 06:53:04,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 973 transitions, 2006 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:04,360 INFO L231 Difference]: Finished difference. Result has 962 places, 973 transitions, 1954 flow [2025-03-04 06:53:04,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1954, PETRI_PLACES=962, PETRI_TRANSITIONS=973} [2025-03-04 06:53:04,363 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2025-03-04 06:53:04,363 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 973 transitions, 1954 flow [2025-03-04 06:53:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:04,365 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] [2025-03-04 06:53:04,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:53:04,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:04,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1544170900, now seen corresponding path program 1 times [2025-03-04 06:53:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:04,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184747549] [2025-03-04 06:53:04,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:04,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:53:04,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:53:04,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:04,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:04,449 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-04 06:53:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184747549] [2025-03-04 06:53:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184747549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898863899] [2025-03-04 06:53:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:04,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:04,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:04,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:04,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:04,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-03-04 06:53:04,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 973 transitions, 1954 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:04,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:04,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-03-04 06:53:04,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:05,010 INFO L124 PetriNetUnfolderBase]: 62/2211 cut-off events. [2025-03-04 06:53:05,010 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2025-03-04 06:53:05,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 2211 events. 62/2211 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11182 event pairs, 21 based on Foata normal form. 0/1845 useless extension candidates. Maximal degree in co-relation 2244. Up to 62 conditions per place. [2025-03-04 06:53:05,051 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/972 dead transitions. [2025-03-04 06:53:05,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 972 transitions, 1994 flow [2025-03-04 06:53:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2025-03-04 06:53:05,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621501272264631 [2025-03-04 06:53:05,057 INFO L175 Difference]: Start difference. First operand has 962 places, 973 transitions, 1954 flow. Second operand 3 states and 3025 transitions. [2025-03-04 06:53:05,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 972 transitions, 1994 flow [2025-03-04 06:53:05,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 972 transitions, 1993 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:05,073 INFO L231 Difference]: Finished difference. Result has 962 places, 972 transitions, 1955 flow [2025-03-04 06:53:05,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1955, PETRI_PLACES=962, PETRI_TRANSITIONS=972} [2025-03-04 06:53:05,075 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2025-03-04 06:53:05,076 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 972 transitions, 1955 flow [2025-03-04 06:53:05,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:05,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:05,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:53:05,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:05,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash 954477337, now seen corresponding path program 1 times [2025-03-04 06:53:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748994630] [2025-03-04 06:53:05,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:05,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:53:05,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:53:05,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:05,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:05,149 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-04 06:53:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:05,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748994630] [2025-03-04 06:53:05,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748994630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:05,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:05,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786100620] [2025-03-04 06:53:05,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:05,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:05,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:05,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:05,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:05,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-03-04 06:53:05,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 972 transitions, 1955 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:05,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-03-04 06:53:05,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:05,666 INFO L124 PetriNetUnfolderBase]: 116/2624 cut-off events. [2025-03-04 06:53:05,666 INFO L125 PetriNetUnfolderBase]: For 17/119 co-relation queries the response was YES. [2025-03-04 06:53:05,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 2624 events. 116/2624 cut-off events. For 17/119 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15973 event pairs, 60 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 2753. Up to 149 conditions per place. [2025-03-04 06:53:05,721 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/962 dead transitions. [2025-03-04 06:53:05,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 962 transitions, 1989 flow [2025-03-04 06:53:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-03-04 06:53:05,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-03-04 06:53:05,726 INFO L175 Difference]: Start difference. First operand has 962 places, 972 transitions, 1955 flow. Second operand 3 states and 2998 transitions. [2025-03-04 06:53:05,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 962 transitions, 1989 flow [2025-03-04 06:53:05,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 962 transitions, 1985 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:05,738 INFO L231 Difference]: Finished difference. Result has 952 places, 962 transitions, 1933 flow [2025-03-04 06:53:05,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1933, PETRI_PLACES=952, PETRI_TRANSITIONS=962} [2025-03-04 06:53:05,741 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2025-03-04 06:53:05,741 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 962 transitions, 1933 flow [2025-03-04 06:53:05,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:05,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:05,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:53:05,743 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:05,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash -906115713, now seen corresponding path program 1 times [2025-03-04 06:53:05,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:05,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678842537] [2025-03-04 06:53:05,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:05,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:53:05,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:53:05,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:05,781 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-04 06:53:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678842537] [2025-03-04 06:53:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678842537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875866267] [2025-03-04 06:53:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:05,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-03-04 06:53:05,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 962 transitions, 1933 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:05,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:05,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-03-04 06:53:05,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:06,105 INFO L124 PetriNetUnfolderBase]: 74/1837 cut-off events. [2025-03-04 06:53:06,105 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-03-04 06:53:06,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1837 events. 74/1837 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8546 event pairs, 39 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 1895. Up to 89 conditions per place. [2025-03-04 06:53:06,131 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/961 dead transitions. [2025-03-04 06:53:06,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 961 transitions, 1973 flow [2025-03-04 06:53:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2025-03-04 06:53:06,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621501272264631 [2025-03-04 06:53:06,137 INFO L175 Difference]: Start difference. First operand has 952 places, 962 transitions, 1933 flow. Second operand 3 states and 3025 transitions. [2025-03-04 06:53:06,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 961 transitions, 1973 flow [2025-03-04 06:53:06,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 961 transitions, 1972 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:06,150 INFO L231 Difference]: Finished difference. Result has 952 places, 961 transitions, 1934 flow [2025-03-04 06:53:06,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1934, PETRI_PLACES=952, PETRI_TRANSITIONS=961} [2025-03-04 06:53:06,152 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2025-03-04 06:53:06,153 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 961 transitions, 1934 flow [2025-03-04 06:53:06,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:06,155 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] [2025-03-04 06:53:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:53:06,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:06,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:06,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1700716812, now seen corresponding path program 1 times [2025-03-04 06:53:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664213176] [2025-03-04 06:53:06,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:06,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:53:06,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:53:06,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:06,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:06,191 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-04 06:53:06,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664213176] [2025-03-04 06:53:06,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664213176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:06,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:06,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:06,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056662985] [2025-03-04 06:53:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:06,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:06,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:06,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:06,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-03-04 06:53:06,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 961 transitions, 1934 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:06,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-03-04 06:53:06,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:06,768 INFO L124 PetriNetUnfolderBase]: 226/3707 cut-off events. [2025-03-04 06:53:06,768 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-03-04 06:53:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 3707 events. 226/3707 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 27028 event pairs, 132 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 3956. Up to 274 conditions per place. [2025-03-04 06:53:06,819 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/951 dead transitions. [2025-03-04 06:53:06,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 951 transitions, 1968 flow [2025-03-04 06:53:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-03-04 06:53:06,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-03-04 06:53:06,823 INFO L175 Difference]: Start difference. First operand has 952 places, 961 transitions, 1934 flow. Second operand 3 states and 2998 transitions. [2025-03-04 06:53:06,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 951 transitions, 1968 flow [2025-03-04 06:53:06,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 951 transitions, 1964 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:06,832 INFO L231 Difference]: Finished difference. Result has 942 places, 951 transitions, 1912 flow [2025-03-04 06:53:06,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=942, PETRI_TRANSITIONS=951} [2025-03-04 06:53:06,834 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-03-04 06:53:06,834 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 951 transitions, 1912 flow [2025-03-04 06:53:06,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:06,836 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] [2025-03-04 06:53:06,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:53:06,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:06,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1085972232, now seen corresponding path program 1 times [2025-03-04 06:53:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166467453] [2025-03-04 06:53:06,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:06,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:53:06,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:53:06,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:06,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:06,875 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-04 06:53:06,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166467453] [2025-03-04 06:53:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166467453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261049931] [2025-03-04 06:53:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:06,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:06,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:06,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:06,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:06,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-04 06:53:06,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 951 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:06,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:06,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-04 06:53:06,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,088 INFO L124 PetriNetUnfolderBase]: 25/1251 cut-off events. [2025-03-04 06:53:07,088 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:53:07,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1251 events. 25/1251 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3306 event pairs, 2 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 1236. Up to 16 conditions per place. [2025-03-04 06:53:07,104 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/950 dead transitions. [2025-03-04 06:53:07,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 950 transitions, 1936 flow [2025-03-04 06:53:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-04 06:53:07,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-04 06:53:07,111 INFO L175 Difference]: Start difference. First operand has 942 places, 951 transitions, 1912 flow. Second operand 3 states and 3041 transitions. [2025-03-04 06:53:07,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 950 transitions, 1936 flow [2025-03-04 06:53:07,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 950 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:07,123 INFO L231 Difference]: Finished difference. Result has 942 places, 950 transitions, 1913 flow [2025-03-04 06:53:07,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1913, PETRI_PLACES=942, PETRI_TRANSITIONS=950} [2025-03-04 06:53:07,125 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-03-04 06:53:07,125 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 950 transitions, 1913 flow [2025-03-04 06:53:07,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:07,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] [2025-03-04 06:53:07,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:53:07,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:07,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1178601458, now seen corresponding path program 1 times [2025-03-04 06:53:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396198461] [2025-03-04 06:53:07,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:07,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 06:53:07,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 06:53:07,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:07,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:07,172 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-04 06:53:07,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396198461] [2025-03-04 06:53:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396198461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:07,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:07,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565533564] [2025-03-04 06:53:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:07,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:07,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:07,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:07,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:07,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 950 transitions, 1913 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:07,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:07,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,580 INFO L124 PetriNetUnfolderBase]: 41/1852 cut-off events. [2025-03-04 06:53:07,580 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-04 06:53:07,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1852 events. 41/1852 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8327 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1852. Up to 25 conditions per place. [2025-03-04 06:53:07,613 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/949 dead transitions. [2025-03-04 06:53:07,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 949 transitions, 1939 flow [2025-03-04 06:53:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:07,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:07,619 INFO L175 Difference]: Start difference. First operand has 942 places, 950 transitions, 1913 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:07,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 949 transitions, 1939 flow [2025-03-04 06:53:07,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 949 transitions, 1935 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:07,634 INFO L231 Difference]: Finished difference. Result has 941 places, 949 transitions, 1911 flow [2025-03-04 06:53:07,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1911, PETRI_PLACES=941, PETRI_TRANSITIONS=949} [2025-03-04 06:53:07,636 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -52 predicate places. [2025-03-04 06:53:07,636 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 949 transitions, 1911 flow [2025-03-04 06:53:07,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:07,638 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] [2025-03-04 06:53:07,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:53:07,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -754117956, now seen corresponding path program 1 times [2025-03-04 06:53:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229846398] [2025-03-04 06:53:07,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:07,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:53:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:53:07,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:07,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:07,703 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-04 06:53:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:07,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229846398] [2025-03-04 06:53:07,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229846398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:07,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79412222] [2025-03-04 06:53:07,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:07,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:07,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:07,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:07,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 949 transitions, 1911 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:07,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:07,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:07,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:07,965 INFO L124 PetriNetUnfolderBase]: 41/1851 cut-off events. [2025-03-04 06:53:07,965 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-04 06:53:07,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1851 events. 41/1851 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8277 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1851. Up to 25 conditions per place. [2025-03-04 06:53:07,994 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/948 dead transitions. [2025-03-04 06:53:07,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 948 transitions, 1937 flow [2025-03-04 06:53:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:07,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:07,998 INFO L175 Difference]: Start difference. First operand has 941 places, 949 transitions, 1911 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:07,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 948 transitions, 1937 flow [2025-03-04 06:53:08,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 948 transitions, 1933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:08,009 INFO L231 Difference]: Finished difference. Result has 940 places, 948 transitions, 1909 flow [2025-03-04 06:53:08,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1909, PETRI_PLACES=940, PETRI_TRANSITIONS=948} [2025-03-04 06:53:08,011 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -53 predicate places. [2025-03-04 06:53:08,011 INFO L471 AbstractCegarLoop]: Abstraction has has 940 places, 948 transitions, 1909 flow [2025-03-04 06:53:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:53:08,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:08,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash -58618866, now seen corresponding path program 1 times [2025-03-04 06:53:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40715959] [2025-03-04 06:53:08,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:53:08,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:53:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:08,052 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-04 06:53:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40715959] [2025-03-04 06:53:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40715959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004699664] [2025-03-04 06:53:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:08,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:08,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:08,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 948 transitions, 1909 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:08,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:08,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:08,198 INFO L124 PetriNetUnfolderBase]: 22/1098 cut-off events. [2025-03-04 06:53:08,198 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-04 06:53:08,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 1098 events. 22/1098 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2537 event pairs, 2 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1085. Up to 17 conditions per place. [2025-03-04 06:53:08,213 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/947 dead transitions. [2025-03-04 06:53:08,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 947 transitions, 1935 flow [2025-03-04 06:53:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:08,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:08,217 INFO L175 Difference]: Start difference. First operand has 940 places, 948 transitions, 1909 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:08,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 947 transitions, 1935 flow [2025-03-04 06:53:08,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 947 transitions, 1931 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:08,227 INFO L231 Difference]: Finished difference. Result has 939 places, 947 transitions, 1907 flow [2025-03-04 06:53:08,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=939, PETRI_TRANSITIONS=947} [2025-03-04 06:53:08,229 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -54 predicate places. [2025-03-04 06:53:08,229 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 947 transitions, 1907 flow [2025-03-04 06:53:08,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,230 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] [2025-03-04 06:53:08,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:53:08,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1297329092, now seen corresponding path program 1 times [2025-03-04 06:53:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845062944] [2025-03-04 06:53:08,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:53:08,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:53:08,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:08,269 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-04 06:53:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845062944] [2025-03-04 06:53:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845062944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:08,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:08,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439043095] [2025-03-04 06:53:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:08,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:08,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:08,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:08,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:08,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 947 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:08,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:08,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:08,465 INFO L124 PetriNetUnfolderBase]: 32/1399 cut-off events. [2025-03-04 06:53:08,465 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-04 06:53:08,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1399 events. 32/1399 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4854 event pairs, 6 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1396. Up to 25 conditions per place. [2025-03-04 06:53:08,490 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-03-04 06:53:08,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 946 transitions, 1933 flow [2025-03-04 06:53:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:08,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:08,494 INFO L175 Difference]: Start difference. First operand has 939 places, 947 transitions, 1907 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:08,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 946 transitions, 1933 flow [2025-03-04 06:53:08,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 946 transitions, 1929 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:08,503 INFO L231 Difference]: Finished difference. Result has 938 places, 946 transitions, 1905 flow [2025-03-04 06:53:08,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=938, PETRI_TRANSITIONS=946} [2025-03-04 06:53:08,505 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -55 predicate places. [2025-03-04 06:53:08,505 INFO L471 AbstractCegarLoop]: Abstraction has has 938 places, 946 transitions, 1905 flow [2025-03-04 06:53:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,507 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] [2025-03-04 06:53:08,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:53:08,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:08,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1834164293, now seen corresponding path program 1 times [2025-03-04 06:53:08,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806066053] [2025-03-04 06:53:08,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:53:08,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:53:08,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:08,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-04 06:53:08,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806066053] [2025-03-04 06:53:08,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806066053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:08,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:08,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332171216] [2025-03-04 06:53:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:08,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:08,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:08,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:08,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:08,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:08,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:08,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:08,762 INFO L124 PetriNetUnfolderBase]: 32/1398 cut-off events. [2025-03-04 06:53:08,762 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-04 06:53:08,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1398 events. 32/1398 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4835 event pairs, 6 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1395. Up to 25 conditions per place. [2025-03-04 06:53:08,784 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-03-04 06:53:08,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 945 transitions, 1931 flow [2025-03-04 06:53:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:08,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:08,788 INFO L175 Difference]: Start difference. First operand has 938 places, 946 transitions, 1905 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:08,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 945 transitions, 1931 flow [2025-03-04 06:53:08,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:08,798 INFO L231 Difference]: Finished difference. Result has 937 places, 945 transitions, 1903 flow [2025-03-04 06:53:08,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=937, PETRI_TRANSITIONS=945} [2025-03-04 06:53:08,800 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -56 predicate places. [2025-03-04 06:53:08,800 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 945 transitions, 1903 flow [2025-03-04 06:53:08,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:08,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:53:08,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,802 INFO L85 PathProgramCache]: Analyzing trace with hash -955132685, now seen corresponding path program 1 times [2025-03-04 06:53:08,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142180898] [2025-03-04 06:53:08,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 06:53:08,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 06:53:08,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:08,830 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-04 06:53:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142180898] [2025-03-04 06:53:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142180898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411514183] [2025-03-04 06:53:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:08,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:08,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:08,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:08,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:08,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:08,958 INFO L124 PetriNetUnfolderBase]: 19/974 cut-off events. [2025-03-04 06:53:08,959 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:53:08,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 974 events. 19/974 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2070 event pairs, 2 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 960. Up to 17 conditions per place. [2025-03-04 06:53:08,968 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-03-04 06:53:08,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 944 transitions, 1929 flow [2025-03-04 06:53:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:08,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:08,972 INFO L175 Difference]: Start difference. First operand has 937 places, 945 transitions, 1903 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:08,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 944 transitions, 1929 flow [2025-03-04 06:53:08,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:08,981 INFO L231 Difference]: Finished difference. Result has 936 places, 944 transitions, 1901 flow [2025-03-04 06:53:08,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=936, PETRI_TRANSITIONS=944} [2025-03-04 06:53:08,982 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -57 predicate places. [2025-03-04 06:53:08,982 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 944 transitions, 1901 flow [2025-03-04 06:53:08,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:08,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:08,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:08,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:53:08,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:08,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -221034529, now seen corresponding path program 1 times [2025-03-04 06:53:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:08,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002573616] [2025-03-04 06:53:08,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:08,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 06:53:08,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 06:53:08,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:08,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:09,017 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-04 06:53:09,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:09,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002573616] [2025-03-04 06:53:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002573616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239682196] [2025-03-04 06:53:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:09,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:09,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:09,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:09,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:09,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:09,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:09,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:09,174 INFO L124 PetriNetUnfolderBase]: 29/1209 cut-off events. [2025-03-04 06:53:09,175 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-04 06:53:09,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1209 events. 29/1209 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3077 event pairs, 6 based on Foata normal form. 0/1065 useless extension candidates. Maximal degree in co-relation 1203. Up to 25 conditions per place. [2025-03-04 06:53:09,191 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-03-04 06:53:09,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 943 transitions, 1927 flow [2025-03-04 06:53:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:09,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:09,195 INFO L175 Difference]: Start difference. First operand has 936 places, 944 transitions, 1901 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:09,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 943 transitions, 1927 flow [2025-03-04 06:53:09,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 943 transitions, 1923 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:09,205 INFO L231 Difference]: Finished difference. Result has 935 places, 943 transitions, 1899 flow [2025-03-04 06:53:09,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=935, PETRI_TRANSITIONS=943} [2025-03-04 06:53:09,206 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -58 predicate places. [2025-03-04 06:53:09,207 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 943 transitions, 1899 flow [2025-03-04 06:53:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:09,208 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] [2025-03-04 06:53:09,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:53:09,208 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:09,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1361236959, now seen corresponding path program 1 times [2025-03-04 06:53:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:09,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868128454] [2025-03-04 06:53:09,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:09,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:09,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 06:53:09,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 06:53:09,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:09,238 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-04 06:53:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868128454] [2025-03-04 06:53:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868128454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546799146] [2025-03-04 06:53:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:09,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:09,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-03-04 06:53:09,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:09,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-03-04 06:53:09,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:09,390 INFO L124 PetriNetUnfolderBase]: 29/1170 cut-off events. [2025-03-04 06:53:09,390 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-04 06:53:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1170 events. 29/1170 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2954 event pairs, 6 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1164. Up to 25 conditions per place. [2025-03-04 06:53:09,404 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-03-04 06:53:09,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 942 transitions, 1925 flow [2025-03-04 06:53:09,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-03-04 06:53:09,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-03-04 06:53:09,408 INFO L175 Difference]: Start difference. First operand has 935 places, 943 transitions, 1899 flow. Second operand 3 states and 3039 transitions. [2025-03-04 06:53:09,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 942 transitions, 1925 flow [2025-03-04 06:53:09,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:09,418 INFO L231 Difference]: Finished difference. Result has 934 places, 942 transitions, 1897 flow [2025-03-04 06:53:09,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=934, PETRI_TRANSITIONS=942} [2025-03-04 06:53:09,420 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -59 predicate places. [2025-03-04 06:53:09,420 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 942 transitions, 1897 flow [2025-03-04 06:53:09,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:09,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:09,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:53:09,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:09,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash -760226022, now seen corresponding path program 1 times [2025-03-04 06:53:09,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:09,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245761339] [2025-03-04 06:53:09,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:09,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 06:53:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 06:53:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:09,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:09,495 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-04 06:53:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245761339] [2025-03-04 06:53:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245761339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641225810] [2025-03-04 06:53:09,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:09,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:09,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:09,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:09,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-03-04 06:53:09,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:09,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-03-04 06:53:09,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:09,825 INFO L124 PetriNetUnfolderBase]: 61/2113 cut-off events. [2025-03-04 06:53:09,825 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:53:09,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 2113 events. 61/2113 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10794 event pairs, 20 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 2142. Up to 50 conditions per place. [2025-03-04 06:53:09,846 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2025-03-04 06:53:09,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 941 transitions, 1925 flow [2025-03-04 06:53:09,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-03-04 06:53:09,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-03-04 06:53:09,850 INFO L175 Difference]: Start difference. First operand has 934 places, 942 transitions, 1897 flow. Second operand 3 states and 3037 transitions. [2025-03-04 06:53:09,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 941 transitions, 1925 flow [2025-03-04 06:53:09,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 941 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:09,862 INFO L231 Difference]: Finished difference. Result has 933 places, 941 transitions, 1895 flow [2025-03-04 06:53:09,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=933, PETRI_TRANSITIONS=941} [2025-03-04 06:53:09,863 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -60 predicate places. [2025-03-04 06:53:09,864 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 941 transitions, 1895 flow [2025-03-04 06:53:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:09,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:09,865 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] [2025-03-04 06:53:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:53:09,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:09,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1432425491, now seen corresponding path program 1 times [2025-03-04 06:53:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992984035] [2025-03-04 06:53:09,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:09,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 06:53:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 06:53:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:09,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:10,390 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-04 06:53:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992984035] [2025-03-04 06:53:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992984035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:10,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:10,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678953653] [2025-03-04 06:53:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:10,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:10,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:10,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1048 [2025-03-04 06:53:10,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 941 transitions, 1895 flow. Second operand has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:10,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:10,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1048 [2025-03-04 06:53:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:24,195 INFO L124 PetriNetUnfolderBase]: 15256/85355 cut-off events. [2025-03-04 06:53:24,195 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-04 06:53:24,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107784 conditions, 85355 events. 15256/85355 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1264011 event pairs, 14040 based on Foata normal form. 0/74617 useless extension candidates. Maximal degree in co-relation 107742. Up to 22026 conditions per place. [2025-03-04 06:53:24,758 INFO L140 encePairwiseOnDemand]: 1030/1048 looper letters, 87 selfloop transitions, 15 changer transitions 0/938 dead transitions. [2025-03-04 06:53:24,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 938 transitions, 2093 flow [2025-03-04 06:53:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5619 transitions. [2025-03-04 06:53:24,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936068702290076 [2025-03-04 06:53:24,765 INFO L175 Difference]: Start difference. First operand has 933 places, 941 transitions, 1895 flow. Second operand 6 states and 5619 transitions. [2025-03-04 06:53:24,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 938 transitions, 2093 flow [2025-03-04 06:53:24,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 938 transitions, 2089 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:24,772 INFO L231 Difference]: Finished difference. Result has 933 places, 938 transitions, 1915 flow [2025-03-04 06:53:24,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1915, PETRI_PLACES=933, PETRI_TRANSITIONS=938} [2025-03-04 06:53:24,773 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -60 predicate places. [2025-03-04 06:53:24,773 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 938 transitions, 1915 flow [2025-03-04 06:53:24,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:24,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:24,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:53:24,775 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:24,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1856402539, now seen corresponding path program 1 times [2025-03-04 06:53:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144986207] [2025-03-04 06:53:24,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:24,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 06:53:24,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 06:53:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:24,821 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-04 06:53:24,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144986207] [2025-03-04 06:53:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144986207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300370463] [2025-03-04 06:53:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:24,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:24,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:24,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:24,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-03-04 06:53:24,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 938 transitions, 1915 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:24,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:24,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-03-04 06:53:24,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:25,188 INFO L124 PetriNetUnfolderBase]: 47/1835 cut-off events. [2025-03-04 06:53:25,189 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-04 06:53:25,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1835 events. 47/1835 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7516 event pairs, 12 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 1859. Up to 38 conditions per place. [2025-03-04 06:53:25,207 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2025-03-04 06:53:25,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 937 transitions, 1943 flow [2025-03-04 06:53:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-03-04 06:53:25,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-03-04 06:53:25,211 INFO L175 Difference]: Start difference. First operand has 933 places, 938 transitions, 1915 flow. Second operand 3 states and 3037 transitions. [2025-03-04 06:53:25,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 937 transitions, 1943 flow [2025-03-04 06:53:25,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:53:25,219 INFO L231 Difference]: Finished difference. Result has 929 places, 937 transitions, 1887 flow [2025-03-04 06:53:25,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=929, PETRI_TRANSITIONS=937} [2025-03-04 06:53:25,220 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -64 predicate places. [2025-03-04 06:53:25,220 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 937 transitions, 1887 flow [2025-03-04 06:53:25,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:25,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:25,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:25,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:53:25,221 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:25,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash -252349388, now seen corresponding path program 1 times [2025-03-04 06:53:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:25,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315099175] [2025-03-04 06:53:25,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:25,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:25,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-04 06:53:25,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 06:53:25,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:25,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:25,279 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-04 06:53:25,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:25,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315099175] [2025-03-04 06:53:25,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315099175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:25,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:25,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:25,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130867132] [2025-03-04 06:53:25,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:25,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:25,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:25,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-03-04 06:53:25,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 937 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:25,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:25,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-03-04 06:53:25,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:25,500 INFO L124 PetriNetUnfolderBase]: 52/1631 cut-off events. [2025-03-04 06:53:25,500 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-03-04 06:53:25,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1631 events. 52/1631 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6180 event pairs, 20 based on Foata normal form. 0/1424 useless extension candidates. Maximal degree in co-relation 1652. Up to 50 conditions per place. [2025-03-04 06:53:25,521 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/936 dead transitions. [2025-03-04 06:53:25,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 936 transitions, 1915 flow [2025-03-04 06:53:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-03-04 06:53:25,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-03-04 06:53:25,526 INFO L175 Difference]: Start difference. First operand has 929 places, 937 transitions, 1887 flow. Second operand 3 states and 3037 transitions. [2025-03-04 06:53:25,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 936 transitions, 1915 flow [2025-03-04 06:53:25,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 936 transitions, 1911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:25,535 INFO L231 Difference]: Finished difference. Result has 928 places, 936 transitions, 1885 flow [2025-03-04 06:53:25,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1885, PETRI_PLACES=928, PETRI_TRANSITIONS=936} [2025-03-04 06:53:25,537 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -65 predicate places. [2025-03-04 06:53:25,537 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 936 transitions, 1885 flow [2025-03-04 06:53:25,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:25,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:25,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:25,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:53:25,538 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:25,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 98411887, now seen corresponding path program 1 times [2025-03-04 06:53:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:25,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871368508] [2025-03-04 06:53:25,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:25,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-04 06:53:25,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-04 06:53:25,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:25,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:25,667 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-04 06:53:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871368508] [2025-03-04 06:53:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871368508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:25,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819045430] [2025-03-04 06:53:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:25,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:25,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:25,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:25,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1048 [2025-03-04 06:53:25,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 936 transitions, 1885 flow. Second operand has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:25,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:25,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1048 [2025-03-04 06:53:25,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:38,628 INFO L124 PetriNetUnfolderBase]: 15256/85350 cut-off events. [2025-03-04 06:53:38,628 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-04 06:53:38,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107779 conditions, 85350 events. 15256/85350 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1263839 event pairs, 14040 based on Foata normal form. 0/74617 useless extension candidates. Maximal degree in co-relation 107737. Up to 22035 conditions per place. [2025-03-04 06:53:39,110 INFO L140 encePairwiseOnDemand]: 1039/1048 looper letters, 96 selfloop transitions, 6 changer transitions 0/933 dead transitions. [2025-03-04 06:53:39,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 933 transitions, 2083 flow [2025-03-04 06:53:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:39,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2862 transitions. [2025-03-04 06:53:39,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103053435114504 [2025-03-04 06:53:39,114 INFO L175 Difference]: Start difference. First operand has 928 places, 936 transitions, 1885 flow. Second operand 3 states and 2862 transitions. [2025-03-04 06:53:39,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 933 transitions, 2083 flow [2025-03-04 06:53:39,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 933 transitions, 2079 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:39,121 INFO L231 Difference]: Finished difference. Result has 925 places, 933 transitions, 1887 flow [2025-03-04 06:53:39,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=925, PETRI_TRANSITIONS=933} [2025-03-04 06:53:39,122 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -68 predicate places. [2025-03-04 06:53:39,122 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 933 transitions, 1887 flow [2025-03-04 06:53:39,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:39,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:53:39,123 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1501051719, now seen corresponding path program 1 times [2025-03-04 06:53:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:39,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097415431] [2025-03-04 06:53:39,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:39,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 06:53:39,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 06:53:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:39,175 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-04 06:53:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097415431] [2025-03-04 06:53:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097415431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153036539] [2025-03-04 06:53:39,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:39,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:39,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:39,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:39,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:39,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-04 06:53:39,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 933 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:39,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-04 06:53:39,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:39,371 INFO L124 PetriNetUnfolderBase]: 36/1535 cut-off events. [2025-03-04 06:53:39,371 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-04 06:53:39,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 1535 events. 36/1535 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5796 event pairs, 7 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 1550. Up to 25 conditions per place. [2025-03-04 06:53:39,389 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-03-04 06:53:39,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 932 transitions, 1911 flow [2025-03-04 06:53:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-04 06:53:39,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-04 06:53:39,392 INFO L175 Difference]: Start difference. First operand has 925 places, 933 transitions, 1887 flow. Second operand 3 states and 3041 transitions. [2025-03-04 06:53:39,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 932 transitions, 1911 flow [2025-03-04 06:53:39,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 932 transitions, 1899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:39,400 INFO L231 Difference]: Finished difference. Result has 924 places, 932 transitions, 1877 flow [2025-03-04 06:53:39,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=924, PETRI_TRANSITIONS=932} [2025-03-04 06:53:39,401 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -69 predicate places. [2025-03-04 06:53:39,401 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 932 transitions, 1877 flow [2025-03-04 06:53:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:39,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:39,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:53:39,402 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 825668778, now seen corresponding path program 1 times [2025-03-04 06:53:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817645818] [2025-03-04 06:53:39,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:39,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-04 06:53:39,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-04 06:53:39,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:39,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:39,466 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-04 06:53:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:39,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817645818] [2025-03-04 06:53:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817645818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:39,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:39,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294141455] [2025-03-04 06:53:39,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:39,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:39,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:39,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:39,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-04 06:53:39,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:39,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-04 06:53:39,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:39,644 INFO L124 PetriNetUnfolderBase]: 34/1447 cut-off events. [2025-03-04 06:53:39,644 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-04 06:53:39,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 1447 events. 34/1447 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4557 event pairs, 5 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1440. Up to 22 conditions per place. [2025-03-04 06:53:39,661 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/931 dead transitions. [2025-03-04 06:53:39,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 931 transitions, 1901 flow [2025-03-04 06:53:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-04 06:53:39,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-04 06:53:39,663 INFO L175 Difference]: Start difference. First operand has 924 places, 932 transitions, 1877 flow. Second operand 3 states and 3041 transitions. [2025-03-04 06:53:39,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 931 transitions, 1901 flow [2025-03-04 06:53:39,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 931 transitions, 1897 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:39,671 INFO L231 Difference]: Finished difference. Result has 923 places, 931 transitions, 1875 flow [2025-03-04 06:53:39,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=929, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=923, PETRI_TRANSITIONS=931} [2025-03-04 06:53:39,672 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -70 predicate places. [2025-03-04 06:53:39,673 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 931 transitions, 1875 flow [2025-03-04 06:53:39,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:39,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:39,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:53:39,674 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1456552041, now seen corresponding path program 1 times [2025-03-04 06:53:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307963974] [2025-03-04 06:53:39,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:39,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 06:53:39,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 06:53:39,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:39,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:39,740 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-04 06:53:39,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:39,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307963974] [2025-03-04 06:53:39,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307963974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:39,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:39,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:39,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044642379] [2025-03-04 06:53:39,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:39,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:39,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:39,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:39,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:39,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-03-04 06:53:39,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 931 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:39,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-03-04 06:53:39,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:39,962 INFO L124 PetriNetUnfolderBase]: 32/1276 cut-off events. [2025-03-04 06:53:39,962 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-04 06:53:39,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1276 events. 32/1276 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3628 event pairs, 7 based on Foata normal form. 0/1135 useless extension candidates. Maximal degree in co-relation 1272. Up to 26 conditions per place. [2025-03-04 06:53:39,978 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2025-03-04 06:53:39,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 924 places, 930 transitions, 1899 flow [2025-03-04 06:53:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-03-04 06:53:39,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-03-04 06:53:39,980 INFO L175 Difference]: Start difference. First operand has 923 places, 931 transitions, 1875 flow. Second operand 3 states and 3041 transitions. [2025-03-04 06:53:39,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 924 places, 930 transitions, 1899 flow [2025-03-04 06:53:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 930 transitions, 1895 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:39,990 INFO L231 Difference]: Finished difference. Result has 922 places, 930 transitions, 1873 flow [2025-03-04 06:53:39,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1869, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=928, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1873, PETRI_PLACES=922, PETRI_TRANSITIONS=930} [2025-03-04 06:53:39,990 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -71 predicate places. [2025-03-04 06:53:39,990 INFO L471 AbstractCegarLoop]: Abstraction has has 922 places, 930 transitions, 1873 flow [2025-03-04 06:53:39,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:39,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:39,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:39,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:53:39,991 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1404160852, now seen corresponding path program 1 times [2025-03-04 06:53:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256242942] [2025-03-04 06:53:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:40,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-04 06:53:40,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-04 06:53:40,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:40,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:40,137 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-04 06:53:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:40,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256242942] [2025-03-04 06:53:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256242942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204971298] [2025-03-04 06:53:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:40,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:40,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:40,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:40,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1005 out of 1048 [2025-03-04 06:53:40,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 922 places, 930 transitions, 1873 flow. Second operand has 3 states, 3 states have (on average 1006.3333333333334) internal successors, (3019), 3 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:40,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:40,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1005 of 1048 [2025-03-04 06:53:40,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:40,534 INFO L124 PetriNetUnfolderBase]: 115/2918 cut-off events. [2025-03-04 06:53:40,534 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:53:40,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 2918 events. 115/2918 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 18663 event pairs, 28 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 3046. Up to 127 conditions per place. [2025-03-04 06:53:40,576 INFO L140 encePairwiseOnDemand]: 1042/1048 looper letters, 17 selfloop transitions, 2 changer transitions 0/930 dead transitions. [2025-03-04 06:53:40,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 930 transitions, 1913 flow [2025-03-04 06:53:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3038 transitions. [2025-03-04 06:53:40,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662849872773537 [2025-03-04 06:53:40,578 INFO L175 Difference]: Start difference. First operand has 922 places, 930 transitions, 1873 flow. Second operand 3 states and 3038 transitions. [2025-03-04 06:53:40,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 930 transitions, 1913 flow [2025-03-04 06:53:40,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 930 transitions, 1909 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:40,589 INFO L231 Difference]: Finished difference. Result has 919 places, 928 transitions, 1875 flow [2025-03-04 06:53:40,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1875, PETRI_PLACES=919, PETRI_TRANSITIONS=928} [2025-03-04 06:53:40,590 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -74 predicate places. [2025-03-04 06:53:40,590 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 928 transitions, 1875 flow [2025-03-04 06:53:40,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1006.3333333333334) internal successors, (3019), 3 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:40,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:40,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:40,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:53:40,591 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:40,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1380878832, now seen corresponding path program 1 times [2025-03-04 06:53:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434106072] [2025-03-04 06:53:40,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:40,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-04 06:53:40,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-04 06:53:40,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:40,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:40,753 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-04 06:53:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434106072] [2025-03-04 06:53:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434106072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:53:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120700200] [2025-03-04 06:53:40,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:40,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:53:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:40,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:53:40,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:53:41,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 982 out of 1048 [2025-03-04 06:53:41,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 928 transitions, 1875 flow. Second operand has 7 states, 7 states have (on average 986.4285714285714) internal successors, (6905), 7 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:41,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:41,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 982 of 1048 [2025-03-04 06:53:41,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:41,398 INFO L124 PetriNetUnfolderBase]: 40/1995 cut-off events. [2025-03-04 06:53:41,398 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-04 06:53:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 1995 events. 40/1995 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8867 event pairs, 0 based on Foata normal form. 1/1799 useless extension candidates. Maximal degree in co-relation 2050. Up to 39 conditions per place. [2025-03-04 06:53:41,427 INFO L140 encePairwiseOnDemand]: 1038/1048 looper letters, 67 selfloop transitions, 9 changer transitions 0/963 dead transitions. [2025-03-04 06:53:41,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 963 transitions, 2103 flow [2025-03-04 06:53:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:53:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 06:53:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6951 transitions. [2025-03-04 06:53:41,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475190839694656 [2025-03-04 06:53:41,430 INFO L175 Difference]: Start difference. First operand has 919 places, 928 transitions, 1875 flow. Second operand 7 states and 6951 transitions. [2025-03-04 06:53:41,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 963 transitions, 2103 flow [2025-03-04 06:53:41,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 963 transitions, 2103 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:41,439 INFO L231 Difference]: Finished difference. Result has 929 places, 934 transitions, 1932 flow [2025-03-04 06:53:41,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1932, PETRI_PLACES=929, PETRI_TRANSITIONS=934} [2025-03-04 06:53:41,440 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -64 predicate places. [2025-03-04 06:53:41,440 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 934 transitions, 1932 flow [2025-03-04 06:53:41,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 986.4285714285714) internal successors, (6905), 7 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:41,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:41,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:41,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:53:41,441 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:41,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 253512419, now seen corresponding path program 1 times [2025-03-04 06:53:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:41,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005607560] [2025-03-04 06:53:41,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:41,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-04 06:53:41,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-04 06:53:41,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:41,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:41,643 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-04 06:53:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005607560] [2025-03-04 06:53:41,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005607560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:41,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:41,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 06:53:41,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686272128] [2025-03-04 06:53:41,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:41,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:53:41,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:41,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:53:41,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:53:42,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 977 out of 1048 [2025-03-04 06:53:42,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 934 transitions, 1932 flow. Second operand has 8 states, 8 states have (on average 981.375) internal successors, (7851), 8 states have internal predecessors, (7851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 977 of 1048 [2025-03-04 06:53:42,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,885 INFO L124 PetriNetUnfolderBase]: 58/2915 cut-off events. [2025-03-04 06:53:42,885 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2025-03-04 06:53:42,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 2915 events. 58/2915 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16500 event pairs, 0 based on Foata normal form. 1/2623 useless extension candidates. Maximal degree in co-relation 3057. Up to 80 conditions per place. [2025-03-04 06:53:42,936 INFO L140 encePairwiseOnDemand]: 1035/1048 looper letters, 80 selfloop transitions, 13 changer transitions 0/975 dead transitions. [2025-03-04 06:53:42,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 975 transitions, 2220 flow [2025-03-04 06:53:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:53:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:53:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8881 transitions. [2025-03-04 06:53:42,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9415818490245971 [2025-03-04 06:53:42,943 INFO L175 Difference]: Start difference. First operand has 929 places, 934 transitions, 1932 flow. Second operand 9 states and 8881 transitions. [2025-03-04 06:53:42,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 975 transitions, 2220 flow [2025-03-04 06:53:42,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 975 transitions, 2215 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:42,954 INFO L231 Difference]: Finished difference. Result has 942 places, 945 transitions, 2021 flow [2025-03-04 06:53:42,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2021, PETRI_PLACES=942, PETRI_TRANSITIONS=945} [2025-03-04 06:53:42,955 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-03-04 06:53:42,955 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 945 transitions, 2021 flow [2025-03-04 06:53:42,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 981.375) internal successors, (7851), 8 states have internal predecessors, (7851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:53:42,956 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1977365629, now seen corresponding path program 1 times [2025-03-04 06:53:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016000929] [2025-03-04 06:53:42,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-04 06:53:42,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-04 06:53:42,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:43,510 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-04 06:53:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016000929] [2025-03-04 06:53:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016000929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:43,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:53:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696801435] [2025-03-04 06:53:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:53:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:43,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:53:43,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:53:43,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 975 out of 1048 [2025-03-04 06:53:43,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 945 transitions, 2021 flow. Second operand has 6 states, 6 states have (on average 976.6666666666666) internal successors, (5860), 6 states have internal predecessors, (5860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:43,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 975 of 1048 [2025-03-04 06:53:43,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:46,994 INFO L124 PetriNetUnfolderBase]: 1336/15569 cut-off events. [2025-03-04 06:53:46,995 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 06:53:47,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18096 conditions, 15569 events. 1336/15569 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 177845 event pairs, 273 based on Foata normal form. 0/13625 useless extension candidates. Maximal degree in co-relation 18040. Up to 1686 conditions per place. [2025-03-04 06:53:47,319 INFO L140 encePairwiseOnDemand]: 1036/1048 looper letters, 65 selfloop transitions, 8 changer transitions 0/969 dead transitions. [2025-03-04 06:53:47,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 969 transitions, 2223 flow [2025-03-04 06:53:47,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:53:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:53:47,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5927 transitions. [2025-03-04 06:53:47,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9425890585241731 [2025-03-04 06:53:47,322 INFO L175 Difference]: Start difference. First operand has 942 places, 945 transitions, 2021 flow. Second operand 6 states and 5927 transitions. [2025-03-04 06:53:47,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 969 transitions, 2223 flow [2025-03-04 06:53:47,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 969 transitions, 2223 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:53:47,332 INFO L231 Difference]: Finished difference. Result has 947 places, 949 transitions, 2075 flow [2025-03-04 06:53:47,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=933, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2075, PETRI_PLACES=947, PETRI_TRANSITIONS=949} [2025-03-04 06:53:47,333 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -46 predicate places. [2025-03-04 06:53:47,333 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 949 transitions, 2075 flow [2025-03-04 06:53:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 976.6666666666666) internal successors, (5860), 6 states have internal predecessors, (5860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:47,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:47,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:53:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:53:47,335 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-03-04 06:53:47,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1746017995, now seen corresponding path program 1 times [2025-03-04 06:53:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345220905] [2025-03-04 06:53:47,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:47,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-04 06:53:47,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-04 06:53:47,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:47,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:47,387 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-04 06:53:47,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:47,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345220905] [2025-03-04 06:53:47,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345220905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:47,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:47,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432161981] [2025-03-04 06:53:47,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:47,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:47,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:47,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:47,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1005 out of 1048 [2025-03-04 06:53:47,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 949 transitions, 2075 flow. Second operand has 3 states, 3 states have (on average 1007.0) internal successors, (3021), 3 states have internal predecessors, (3021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:47,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:47,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1005 of 1048 [2025-03-04 06:53:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand