./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:23:20,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:23:20,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:23:20,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:23:20,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:23:20,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:23:20,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:23:20,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:23:20,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:23:20,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:23:20,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:23:20,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:23:20,375 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:23:20,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:23:20,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:23:20,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:23:20,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:23:20,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:20,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:23:20,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:23:20,378 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-13 22:23:20,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:23:20,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:23:20,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:23:20,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:23:20,616 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:23:20,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-13 22:23:21,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a2d5851/791326cb09fb4fdda41589720d661329/FLAG0e68b7e23 [2025-03-13 22:23:22,057 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:23:22,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-13 22:23:22,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a2d5851/791326cb09fb4fdda41589720d661329/FLAG0e68b7e23 [2025-03-13 22:23:22,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a2d5851/791326cb09fb4fdda41589720d661329 [2025-03-13 22:23:22,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:23:22,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:23:22,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:22,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:23:22,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:23:22,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22, skipping insertion in model container [2025-03-13 22:23:22,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:23:22,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:22,629 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:23:22,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:23:22,685 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:23:22,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22 WrapperNode [2025-03-13 22:23:22,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:23:22,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:22,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:23:22,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:23:22,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,758 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 775 [2025-03-13 22:23:22,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:23:22,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:23:22,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:23:22,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:23:22,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:23:22,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:23:22,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:23:22,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:23:22,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (1/1) ... [2025-03-13 22:23:22,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:23:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:22,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:23:22,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:23:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:23:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:23:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:23:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:23:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:23:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:23:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:23:22,922 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:23:23,039 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:23:23,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:23:23,878 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:23:23,879 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:23:23,879 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:23:23,910 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:23:23,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:23 BoogieIcfgContainer [2025-03-13 22:23:23,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:23:23,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:23:23,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:23:23,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:23:23,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:23:22" (1/3) ... [2025-03-13 22:23:23,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b34dc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:23, skipping insertion in model container [2025-03-13 22:23:23,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:23:22" (2/3) ... [2025-03-13 22:23:23,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b34dc92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:23:23, skipping insertion in model container [2025-03-13 22:23:23,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:23:23" (3/3) ... [2025-03-13 22:23:23,944 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-13 22:23:23,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:23:23,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 1001 locations, 1 initial locations, 6 loop locations, and 114 error locations. [2025-03-13 22:23:23,957 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:23:24,097 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:23:24,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1010 places, 1042 transitions, 2105 flow [2025-03-13 22:23:24,430 INFO L124 PetriNetUnfolderBase]: 42/1039 cut-off events. [2025-03-13 22:23:24,433 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:24,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1039 events. 42/1039 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2237 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-13 22:23:24,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 1010 places, 1042 transitions, 2105 flow [2025-03-13 22:23:24,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 988 places, 1018 transitions, 2054 flow [2025-03-13 22:23:24,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:23:24,482 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;@738eb8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:23:24,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2025-03-13 22:23:24,499 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:23:24,499 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-13 22:23:24,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:23:24,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:24,500 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-13 22:23:24,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:24,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash -961876022, now seen corresponding path program 1 times [2025-03-13 22:23:24,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:24,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861783287] [2025-03-13 22:23:24,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:24,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:24,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 22:23:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 22:23:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861783287] [2025-03-13 22:23:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861783287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433009802] [2025-03-13 22:23:24,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:24,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:24,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:24,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:24,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-13 22:23:24,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:24,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:24,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-13 22:23:24,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:25,216 INFO L124 PetriNetUnfolderBase]: 54/1757 cut-off events. [2025-03-13 22:23:25,216 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 22:23:25,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1757 events. 54/1757 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8043 event pairs, 21 based on Foata normal form. 53/1509 useless extension candidates. Maximal degree in co-relation 1271. Up to 62 conditions per place. [2025-03-13 22:23:25,267 INFO L140 encePairwiseOnDemand]: 1017/1042 looper letters, 19 selfloop transitions, 2 changer transitions 16/995 dead transitions. [2025-03-13 22:23:25,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 995 transitions, 2050 flow [2025-03-13 22:23:25,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3029 transitions. [2025-03-13 22:23:25,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689699296225208 [2025-03-13 22:23:25,293 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2054 flow. Second operand 3 states and 3029 transitions. [2025-03-13 22:23:25,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 995 transitions, 2050 flow [2025-03-13 22:23:25,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 995 transitions, 2038 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:23:25,320 INFO L231 Difference]: Finished difference. Result has 983 places, 979 transitions, 1968 flow [2025-03-13 22:23:25,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=983, PETRI_TRANSITIONS=979} [2025-03-13 22:23:25,328 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -5 predicate places. [2025-03-13 22:23:25,329 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 979 transitions, 1968 flow [2025-03-13 22:23:25,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:25,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:25,331 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-13 22:23:25,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:23:25,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1747389207, now seen corresponding path program 1 times [2025-03-13 22:23:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61098678] [2025-03-13 22:23:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:25,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 22:23:25,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 22:23:25,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:25,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:25,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61098678] [2025-03-13 22:23:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61098678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:25,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:25,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394565050] [2025-03-13 22:23:25,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:25,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:25,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:25,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:25,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-13 22:23:25,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 979 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:25,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:25,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-13 22:23:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:26,107 INFO L124 PetriNetUnfolderBase]: 114/2523 cut-off events. [2025-03-13 22:23:26,107 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 22:23:26,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2523 events. 114/2523 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15134 event pairs, 60 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 2647. Up to 146 conditions per place. [2025-03-13 22:23:26,152 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/969 dead transitions. [2025-03-13 22:23:26,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 969 transitions, 2002 flow [2025-03-13 22:23:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-13 22:23:26,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-13 22:23:26,157 INFO L175 Difference]: Start difference. First operand has 983 places, 979 transitions, 1968 flow. Second operand 3 states and 2980 transitions. [2025-03-13 22:23:26,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 969 transitions, 2002 flow [2025-03-13 22:23:26,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 969 transitions, 1998 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:26,168 INFO L231 Difference]: Finished difference. Result has 957 places, 969 transitions, 1946 flow [2025-03-13 22:23:26,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=957, PETRI_TRANSITIONS=969} [2025-03-13 22:23:26,170 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-03-13 22:23:26,170 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 969 transitions, 1946 flow [2025-03-13 22:23:26,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:26,172 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-13 22:23:26,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:23:26,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:26,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1873545488, now seen corresponding path program 1 times [2025-03-13 22:23:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:26,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631997958] [2025-03-13 22:23:26,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:26,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:23:26,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:23:26,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:26,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631997958] [2025-03-13 22:23:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631997958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:26,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368795603] [2025-03-13 22:23:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:26,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:26,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:26,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:26,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-13 22:23:26,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 969 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:26,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-13 22:23:26,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:26,861 INFO L124 PetriNetUnfolderBase]: 90/2666 cut-off events. [2025-03-13 22:23:26,862 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2025-03-13 22:23:26,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2666 events. 90/2666 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16495 event pairs, 39 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2738. Up to 89 conditions per place. [2025-03-13 22:23:26,915 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/968 dead transitions. [2025-03-13 22:23:26,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 968 transitions, 1986 flow [2025-03-13 22:23:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-13 22:23:26,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-03-13 22:23:26,921 INFO L175 Difference]: Start difference. First operand has 957 places, 969 transitions, 1946 flow. Second operand 3 states and 3007 transitions. [2025-03-13 22:23:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 968 transitions, 1986 flow [2025-03-13 22:23:26,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 968 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:26,940 INFO L231 Difference]: Finished difference. Result has 957 places, 968 transitions, 1947 flow [2025-03-13 22:23:26,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1947, PETRI_PLACES=957, PETRI_TRANSITIONS=968} [2025-03-13 22:23:26,942 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-03-13 22:23:26,943 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 968 transitions, 1947 flow [2025-03-13 22:23:26,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:26,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:26,945 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-13 22:23:26,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:23:26,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:26,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash 999556984, now seen corresponding path program 1 times [2025-03-13 22:23:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133366485] [2025-03-13 22:23:26,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:26,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 22:23:26,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 22:23:26,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:27,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:27,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133366485] [2025-03-13 22:23:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133366485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199133913] [2025-03-13 22:23:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:27,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:27,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:27,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:27,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-13 22:23:27,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 968 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:27,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:27,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-13 22:23:27,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:27,864 INFO L124 PetriNetUnfolderBase]: 225/3970 cut-off events. [2025-03-13 22:23:27,864 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-13 22:23:27,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 3970 events. 225/3970 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30208 event pairs, 132 based on Foata normal form. 0/3340 useless extension candidates. Maximal degree in co-relation 4256. Up to 264 conditions per place. [2025-03-13 22:23:27,907 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2025-03-13 22:23:27,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 958 transitions, 1981 flow [2025-03-13 22:23:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-13 22:23:27,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-13 22:23:27,912 INFO L175 Difference]: Start difference. First operand has 957 places, 968 transitions, 1947 flow. Second operand 3 states and 2980 transitions. [2025-03-13 22:23:27,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 958 transitions, 1981 flow [2025-03-13 22:23:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 958 transitions, 1977 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:27,923 INFO L231 Difference]: Finished difference. Result has 947 places, 958 transitions, 1925 flow [2025-03-13 22:23:27,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=947, PETRI_TRANSITIONS=958} [2025-03-13 22:23:27,925 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-03-13 22:23:27,925 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 958 transitions, 1925 flow [2025-03-13 22:23:27,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:27,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:27,926 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-13 22:23:27,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:23:27,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:27,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1484862372, now seen corresponding path program 1 times [2025-03-13 22:23:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:27,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485206926] [2025-03-13 22:23:27,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:23:27,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:23:27,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:27,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485206926] [2025-03-13 22:23:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485206926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:27,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695552130] [2025-03-13 22:23:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:27,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:27,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:28,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-13 22:23:28,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 958 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:28,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:28,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-13 22:23:28,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:28,343 INFO L124 PetriNetUnfolderBase]: 75/1833 cut-off events. [2025-03-13 22:23:28,343 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-03-13 22:23:28,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1833 events. 75/1833 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8420 event pairs, 39 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1891. Up to 89 conditions per place. [2025-03-13 22:23:28,361 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/957 dead transitions. [2025-03-13 22:23:28,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 957 transitions, 1965 flow [2025-03-13 22:23:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-13 22:23:28,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-03-13 22:23:28,366 INFO L175 Difference]: Start difference. First operand has 947 places, 958 transitions, 1925 flow. Second operand 3 states and 3007 transitions. [2025-03-13 22:23:28,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 957 transitions, 1965 flow [2025-03-13 22:23:28,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 957 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:28,375 INFO L231 Difference]: Finished difference. Result has 947 places, 957 transitions, 1926 flow [2025-03-13 22:23:28,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=947, PETRI_TRANSITIONS=957} [2025-03-13 22:23:28,377 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-03-13 22:23:28,377 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 957 transitions, 1926 flow [2025-03-13 22:23:28,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:28,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:28,379 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-13 22:23:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:23:28,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 176196081, now seen corresponding path program 1 times [2025-03-13 22:23:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773658386] [2025-03-13 22:23:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:23:28,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:23:28,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:28,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773658386] [2025-03-13 22:23:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773658386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132840312] [2025-03-13 22:23:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:28,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:28,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:28,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:28,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-13 22:23:28,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 957 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:28,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:28,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-13 22:23:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:29,177 INFO L124 PetriNetUnfolderBase]: 227/3703 cut-off events. [2025-03-13 22:23:29,177 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-03-13 22:23:29,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 3703 events. 227/3703 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 26904 event pairs, 132 based on Foata normal form. 0/3155 useless extension candidates. Maximal degree in co-relation 3952. Up to 274 conditions per place. [2025-03-13 22:23:29,237 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2025-03-13 22:23:29,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 947 transitions, 1960 flow [2025-03-13 22:23:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-13 22:23:29,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-13 22:23:29,244 INFO L175 Difference]: Start difference. First operand has 947 places, 957 transitions, 1926 flow. Second operand 3 states and 2980 transitions. [2025-03-13 22:23:29,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 947 transitions, 1960 flow [2025-03-13 22:23:29,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 947 transitions, 1956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:29,258 INFO L231 Difference]: Finished difference. Result has 937 places, 947 transitions, 1904 flow [2025-03-13 22:23:29,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=937, PETRI_TRANSITIONS=947} [2025-03-13 22:23:29,260 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-03-13 22:23:29,260 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 947 transitions, 1904 flow [2025-03-13 22:23:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:29,263 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-13 22:23:29,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:23:29,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:29,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1862522340, now seen corresponding path program 1 times [2025-03-13 22:23:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190915832] [2025-03-13 22:23:29,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:29,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-13 22:23:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-13 22:23:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:29,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190915832] [2025-03-13 22:23:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190915832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548025041] [2025-03-13 22:23:29,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:29,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:29,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:29,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:29,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-13 22:23:29,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 947 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:29,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-13 22:23:29,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:29,572 INFO L124 PetriNetUnfolderBase]: 26/1247 cut-off events. [2025-03-13 22:23:29,572 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-13 22:23:29,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1247 events. 26/1247 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3314 event pairs, 2 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 1232. Up to 16 conditions per place. [2025-03-13 22:23:29,591 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-03-13 22:23:29,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 946 transitions, 1928 flow [2025-03-13 22:23:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-13 22:23:29,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-13 22:23:29,598 INFO L175 Difference]: Start difference. First operand has 937 places, 947 transitions, 1904 flow. Second operand 3 states and 3023 transitions. [2025-03-13 22:23:29,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 946 transitions, 1928 flow [2025-03-13 22:23:29,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 946 transitions, 1927 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:23:29,611 INFO L231 Difference]: Finished difference. Result has 937 places, 946 transitions, 1905 flow [2025-03-13 22:23:29,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=935, 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=937, PETRI_TRANSITIONS=946} [2025-03-13 22:23:29,612 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-03-13 22:23:29,613 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 946 transitions, 1905 flow [2025-03-13 22:23:29,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:29,615 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-13 22:23:29,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:23:29,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:29,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash 152169937, now seen corresponding path program 1 times [2025-03-13 22:23:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:29,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433086003] [2025-03-13 22:23:29,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:29,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:29,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-13 22:23:29,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-13 22:23:29,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:29,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433086003] [2025-03-13 22:23:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433086003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:29,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746958559] [2025-03-13 22:23:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:29,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:29,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:29,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-13 22:23:29,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:29,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:29,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-13 22:23:29,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:30,039 INFO L124 PetriNetUnfolderBase]: 42/1848 cut-off events. [2025-03-13 22:23:30,039 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-13 22:23:30,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1848 events. 42/1848 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8323 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1848. Up to 25 conditions per place. [2025-03-13 22:23:30,076 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-03-13 22:23:30,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 945 transitions, 1931 flow [2025-03-13 22:23:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-13 22:23:30,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-13 22:23:30,082 INFO L175 Difference]: Start difference. First operand has 937 places, 946 transitions, 1905 flow. Second operand 3 states and 3021 transitions. [2025-03-13 22:23:30,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 945 transitions, 1931 flow [2025-03-13 22:23:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:30,093 INFO L231 Difference]: Finished difference. Result has 936 places, 945 transitions, 1903 flow [2025-03-13 22:23:30,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=934, 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=936, PETRI_TRANSITIONS=945} [2025-03-13 22:23:30,096 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2025-03-13 22:23:30,096 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 945 transitions, 1903 flow [2025-03-13 22:23:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:30,098 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-13 22:23:30,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:23:30,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2116543638, now seen corresponding path program 1 times [2025-03-13 22:23:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:30,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-13 22:23:30,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:30,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-13 22:23:30,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-13 22:23:30,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:30,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850020699] [2025-03-13 22:23:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850020699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:30,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:30,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529652659] [2025-03-13 22:23:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:30,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:30,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:30,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:30,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-13 22:23:30,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:30,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-13 22:23:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:30,397 INFO L124 PetriNetUnfolderBase]: 42/1847 cut-off events. [2025-03-13 22:23:30,397 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-13 22:23:30,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1847 events. 42/1847 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8294 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1847. Up to 25 conditions per place. [2025-03-13 22:23:30,428 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-03-13 22:23:30,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 944 transitions, 1929 flow [2025-03-13 22:23:30,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-13 22:23:30,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-13 22:23:30,432 INFO L175 Difference]: Start difference. First operand has 936 places, 945 transitions, 1903 flow. Second operand 3 states and 3021 transitions. [2025-03-13 22:23:30,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 944 transitions, 1929 flow [2025-03-13 22:23:30,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:30,441 INFO L231 Difference]: Finished difference. Result has 935 places, 944 transitions, 1901 flow [2025-03-13 22:23:30,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=933, 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=935, PETRI_TRANSITIONS=944} [2025-03-13 22:23:30,443 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -53 predicate places. [2025-03-13 22:23:30,443 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 944 transitions, 1901 flow [2025-03-13 22:23:30,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:30,445 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-13 22:23:30,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:23:30,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:30,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1290096329, now seen corresponding path program 1 times [2025-03-13 22:23:30,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:30,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159423329] [2025-03-13 22:23:30,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:30,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:30,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-13 22:23:30,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-13 22:23:30,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:30,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:30,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159423329] [2025-03-13 22:23:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159423329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786027773] [2025-03-13 22:23:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:30,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:30,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:30,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-13 22:23:30,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:30,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-13 22:23:30,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:30,645 INFO L124 PetriNetUnfolderBase]: 23/1094 cut-off events. [2025-03-13 22:23:30,645 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-13 22:23:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1094 events. 23/1094 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2565 event pairs, 2 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1080. Up to 16 conditions per place. [2025-03-13 22:23:30,661 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-03-13 22:23:30,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 943 transitions, 1925 flow [2025-03-13 22:23:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-13 22:23:30,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-13 22:23:30,664 INFO L175 Difference]: Start difference. First operand has 935 places, 944 transitions, 1901 flow. Second operand 3 states and 3023 transitions. [2025-03-13 22:23:30,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 943 transitions, 1925 flow [2025-03-13 22:23:30,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 943 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:30,674 INFO L231 Difference]: Finished difference. Result has 934 places, 943 transitions, 1899 flow [2025-03-13 22:23:30,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=932, 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=934, PETRI_TRANSITIONS=943} [2025-03-13 22:23:30,675 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -54 predicate places. [2025-03-13 22:23:30,675 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 943 transitions, 1899 flow [2025-03-13 22:23:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:30,678 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-13 22:23:30,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:23:30,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1040250114, now seen corresponding path program 1 times [2025-03-13 22:23:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726299140] [2025-03-13 22:23:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:30,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:23:30,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:23:30,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:30,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726299140] [2025-03-13 22:23:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726299140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:30,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395353612] [2025-03-13 22:23:30,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:30,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:30,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:30,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-13 22:23:30,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:30,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-13 22:23:30,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:30,926 INFO L124 PetriNetUnfolderBase]: 33/1395 cut-off events. [2025-03-13 22:23:30,926 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-13 22:23:30,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1395 events. 33/1395 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4871 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1392. Up to 25 conditions per place. [2025-03-13 22:23:30,952 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-03-13 22:23:30,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 942 transitions, 1925 flow [2025-03-13 22:23:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-13 22:23:30,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-13 22:23:30,956 INFO L175 Difference]: Start difference. First operand has 934 places, 943 transitions, 1899 flow. Second operand 3 states and 3021 transitions. [2025-03-13 22:23:30,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 942 transitions, 1925 flow [2025-03-13 22:23:30,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:30,967 INFO L231 Difference]: Finished difference. Result has 933 places, 942 transitions, 1897 flow [2025-03-13 22:23:30,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=931, 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=933, PETRI_TRANSITIONS=942} [2025-03-13 22:23:30,969 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -55 predicate places. [2025-03-13 22:23:30,969 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 942 transitions, 1897 flow [2025-03-13 22:23:30,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:30,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:30,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:30,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:23:30,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash 818013396, now seen corresponding path program 1 times [2025-03-13 22:23:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:30,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530134174] [2025-03-13 22:23:30,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:30,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:30,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-13 22:23:30,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-13 22:23:30,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:30,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:31,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:31,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530134174] [2025-03-13 22:23:31,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530134174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:31,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:31,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170453867] [2025-03-13 22:23:31,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:31,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:31,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:31,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-13 22:23:31,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:31,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-13 22:23:31,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:31,250 INFO L124 PetriNetUnfolderBase]: 33/1394 cut-off events. [2025-03-13 22:23:31,251 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-13 22:23:31,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1394 events. 33/1394 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4817 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1391. Up to 25 conditions per place. [2025-03-13 22:23:31,279 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2025-03-13 22:23:31,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 941 transitions, 1923 flow [2025-03-13 22:23:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-13 22:23:31,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-13 22:23:31,282 INFO L175 Difference]: Start difference. First operand has 933 places, 942 transitions, 1897 flow. Second operand 3 states and 3021 transitions. [2025-03-13 22:23:31,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 941 transitions, 1923 flow [2025-03-13 22:23:31,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 941 transitions, 1919 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:31,323 INFO L231 Difference]: Finished difference. Result has 932 places, 941 transitions, 1895 flow [2025-03-13 22:23:31,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=930, 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=932, PETRI_TRANSITIONS=941} [2025-03-13 22:23:31,325 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -56 predicate places. [2025-03-13 22:23:31,325 INFO L471 AbstractCegarLoop]: Abstraction has has 932 places, 941 transitions, 1895 flow [2025-03-13 22:23:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:31,326 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-13 22:23:31,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:23:31,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:31,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash -58714966, now seen corresponding path program 1 times [2025-03-13 22:23:31,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:31,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910388554] [2025-03-13 22:23:31,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:31,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-13 22:23:31,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-13 22:23:31,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:31,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910388554] [2025-03-13 22:23:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910388554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:31,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202466443] [2025-03-13 22:23:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:31,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:31,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:31,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:31,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-13 22:23:31,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 941 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:31,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-13 22:23:31,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:31,504 INFO L124 PetriNetUnfolderBase]: 20/970 cut-off events. [2025-03-13 22:23:31,504 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-13 22:23:31,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 970 events. 20/970 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2071 event pairs, 2 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 955. Up to 16 conditions per place. [2025-03-13 22:23:31,520 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/940 dead transitions. [2025-03-13 22:23:31,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 940 transitions, 1919 flow [2025-03-13 22:23:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-13 22:23:31,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-13 22:23:31,526 INFO L175 Difference]: Start difference. First operand has 932 places, 941 transitions, 1895 flow. Second operand 3 states and 3023 transitions. [2025-03-13 22:23:31,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 940 transitions, 1919 flow [2025-03-13 22:23:31,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 940 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:31,540 INFO L231 Difference]: Finished difference. Result has 931 places, 940 transitions, 1893 flow [2025-03-13 22:23:31,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1893, PETRI_PLACES=931, PETRI_TRANSITIONS=940} [2025-03-13 22:23:31,543 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -57 predicate places. [2025-03-13 22:23:31,543 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 940 transitions, 1893 flow [2025-03-13 22:23:31,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:31,544 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-13 22:23:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:23:31,544 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -192962854, now seen corresponding path program 1 times [2025-03-13 22:23:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672349770] [2025-03-13 22:23:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:31,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-13 22:23:31,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-13 22:23:31,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:31,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:31,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672349770] [2025-03-13 22:23:31,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672349770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:31,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:31,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516858260] [2025-03-13 22:23:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:31,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:31,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:31,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:31,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-13 22:23:31,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 940 transitions, 1893 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-13 22:23:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:31,735 INFO L124 PetriNetUnfolderBase]: 30/1205 cut-off events. [2025-03-13 22:23:31,735 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-13 22:23:31,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1205 events. 30/1205 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3075 event pairs, 6 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1199. Up to 25 conditions per place. [2025-03-13 22:23:31,751 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/939 dead transitions. [2025-03-13 22:23:31,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 939 transitions, 1919 flow [2025-03-13 22:23:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-13 22:23:31,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-13 22:23:31,755 INFO L175 Difference]: Start difference. First operand has 931 places, 940 transitions, 1893 flow. Second operand 3 states and 3021 transitions. [2025-03-13 22:23:31,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 939 transitions, 1919 flow [2025-03-13 22:23:31,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 939 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:31,765 INFO L231 Difference]: Finished difference. Result has 930 places, 939 transitions, 1891 flow [2025-03-13 22:23:31,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=930, PETRI_TRANSITIONS=939} [2025-03-13 22:23:31,767 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -58 predicate places. [2025-03-13 22:23:31,767 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 939 transitions, 1891 flow [2025-03-13 22:23:31,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:31,768 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-13 22:23:31,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:23:31,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:31,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1323011254, now seen corresponding path program 1 times [2025-03-13 22:23:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692116758] [2025-03-13 22:23:31,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-13 22:23:31,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-13 22:23:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:31,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:31,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:31,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692116758] [2025-03-13 22:23:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692116758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:31,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:31,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493633176] [2025-03-13 22:23:31,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:31,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:31,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:31,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:31,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:31,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-13 22:23:31,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 939 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:31,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:31,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-13 22:23:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:31,972 INFO L124 PetriNetUnfolderBase]: 30/1166 cut-off events. [2025-03-13 22:23:31,973 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-13 22:23:31,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1166 events. 30/1166 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2951 event pairs, 6 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1160. Up to 25 conditions per place. [2025-03-13 22:23:31,988 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2025-03-13 22:23:31,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 938 transitions, 1917 flow [2025-03-13 22:23:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-13 22:23:31,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-13 22:23:31,992 INFO L175 Difference]: Start difference. First operand has 930 places, 939 transitions, 1891 flow. Second operand 3 states and 3021 transitions. [2025-03-13 22:23:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 938 transitions, 1917 flow [2025-03-13 22:23:31,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 938 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:32,002 INFO L231 Difference]: Finished difference. Result has 929 places, 938 transitions, 1889 flow [2025-03-13 22:23:32,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=929, PETRI_TRANSITIONS=938} [2025-03-13 22:23:32,004 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -59 predicate places. [2025-03-13 22:23:32,004 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 938 transitions, 1889 flow [2025-03-13 22:23:32,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:32,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:32,005 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-13 22:23:32,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:23:32,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:32,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:32,006 INFO L85 PathProgramCache]: Analyzing trace with hash 561863228, now seen corresponding path program 1 times [2025-03-13 22:23:32,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:32,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352336503] [2025-03-13 22:23:32,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:32,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:32,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-13 22:23:32,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-13 22:23:32,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:32,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352336503] [2025-03-13 22:23:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352336503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863977522] [2025-03-13 22:23:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:32,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:32,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:32,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-13 22:23:32,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 938 transitions, 1889 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-13 22:23:32,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:32,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-13 22:23:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:32,292 INFO L124 PetriNetUnfolderBase]: 42/1529 cut-off events. [2025-03-13 22:23:32,292 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:23:32,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1529 events. 42/1529 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6379 event pairs, 12 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 1540. Up to 38 conditions per place. [2025-03-13 22:23:32,318 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2025-03-13 22:23:32,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 937 transitions, 1917 flow [2025-03-13 22:23:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-13 22:23:32,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-13 22:23:32,321 INFO L175 Difference]: Start difference. First operand has 929 places, 938 transitions, 1889 flow. Second operand 3 states and 3019 transitions. [2025-03-13 22:23:32,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 937 transitions, 1917 flow [2025-03-13 22:23:32,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:32,330 INFO L231 Difference]: Finished difference. Result has 928 places, 937 transitions, 1887 flow [2025-03-13 22:23:32,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=926, 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=928, PETRI_TRANSITIONS=937} [2025-03-13 22:23:32,331 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2025-03-13 22:23:32,331 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 937 transitions, 1887 flow [2025-03-13 22:23:32,332 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-13 22:23:32,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:32,332 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-13 22:23:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:23:32,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:32,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1880845007, now seen corresponding path program 1 times [2025-03-13 22:23:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319441288] [2025-03-13 22:23:32,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:32,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-13 22:23:32,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-13 22:23:32,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:32,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319441288] [2025-03-13 22:23:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319441288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:32,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:32,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:23:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47228623] [2025-03-13 22:23:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:32,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:23:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:32,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:23:32,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:23:33,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-03-13 22:23:33,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 937 transitions, 1887 flow. Second operand has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:33,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:33,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-03-13 22:23:33,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:47,009 INFO L124 PetriNetUnfolderBase]: 15257/85351 cut-off events. [2025-03-13 22:23:47,010 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-13 22:23:47,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107780 conditions, 85351 events. 15257/85351 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 1264358 event pairs, 14040 based on Foata normal form. 0/74614 useless extension candidates. Maximal degree in co-relation 107738. Up to 22026 conditions per place. [2025-03-13 22:23:47,622 INFO L140 encePairwiseOnDemand]: 1024/1042 looper letters, 87 selfloop transitions, 15 changer transitions 0/934 dead transitions. [2025-03-13 22:23:47,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 934 transitions, 2085 flow [2025-03-13 22:23:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:23:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:23:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5583 transitions. [2025-03-13 22:23:47,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8929942418426103 [2025-03-13 22:23:47,628 INFO L175 Difference]: Start difference. First operand has 928 places, 937 transitions, 1887 flow. Second operand 6 states and 5583 transitions. [2025-03-13 22:23:47,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 934 transitions, 2085 flow [2025-03-13 22:23:47,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 934 transitions, 2081 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:47,636 INFO L231 Difference]: Finished difference. Result has 928 places, 934 transitions, 1907 flow [2025-03-13 22:23:47,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=928, PETRI_TRANSITIONS=934} [2025-03-13 22:23:47,637 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2025-03-13 22:23:47,637 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 934 transitions, 1907 flow [2025-03-13 22:23:47,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:47,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:23:47,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:23:47,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:47,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash 325120538, now seen corresponding path program 1 times [2025-03-13 22:23:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183684613] [2025-03-13 22:23:47,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:47,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-13 22:23:47,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-13 22:23:47,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:47,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:47,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:47,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183684613] [2025-03-13 22:23:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183684613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:47,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:47,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:47,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612594191] [2025-03-13 22:23:47,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:47,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:47,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:47,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:47,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-13 22:23:47,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 934 transitions, 1907 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-13 22:23:47,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:47,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-13 22:23:47,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:48,147 INFO L124 PetriNetUnfolderBase]: 62/2127 cut-off events. [2025-03-13 22:23:48,148 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-13 22:23:48,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 2127 events. 62/2127 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10841 event pairs, 20 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2169. Up to 50 conditions per place. [2025-03-13 22:23:48,198 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2025-03-13 22:23:48,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 933 transitions, 1935 flow [2025-03-13 22:23:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-13 22:23:48,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-13 22:23:48,209 INFO L175 Difference]: Start difference. First operand has 928 places, 934 transitions, 1907 flow. Second operand 3 states and 3019 transitions. [2025-03-13 22:23:48,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 933 transitions, 1935 flow [2025-03-13 22:23:48,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 933 transitions, 1905 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:23:48,227 INFO L231 Difference]: Finished difference. Result has 924 places, 933 transitions, 1879 flow [2025-03-13 22:23:48,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=924, PETRI_TRANSITIONS=933} [2025-03-13 22:23:48,228 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -64 predicate places. [2025-03-13 22:23:48,228 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 933 transitions, 1879 flow [2025-03-13 22:23:48,229 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-13 22:23:48,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:48,229 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-13 22:23:48,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:23:48,230 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:48,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1865059174, now seen corresponding path program 1 times [2025-03-13 22:23:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083791467] [2025-03-13 22:23:48,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:48,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-13 22:23:48,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-13 22:23:48,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:48,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083791467] [2025-03-13 22:23:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083791467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826457982] [2025-03-13 22:23:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:48,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:48,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:48,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:48,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-13 22:23:48,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 933 transitions, 1879 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-13 22:23:48,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:48,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-13 22:23:48,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:48,652 INFO L124 PetriNetUnfolderBase]: 53/1627 cut-off events. [2025-03-13 22:23:48,652 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-03-13 22:23:48,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1627 events. 53/1627 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6135 event pairs, 20 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1648. Up to 50 conditions per place. [2025-03-13 22:23:48,677 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-03-13 22:23:48,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 932 transitions, 1907 flow [2025-03-13 22:23:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:23:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:23:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-13 22:23:48,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-13 22:23:48,682 INFO L175 Difference]: Start difference. First operand has 924 places, 933 transitions, 1879 flow. Second operand 3 states and 3019 transitions. [2025-03-13 22:23:48,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 932 transitions, 1907 flow [2025-03-13 22:23:48,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 932 transitions, 1903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:23:48,693 INFO L231 Difference]: Finished difference. Result has 923 places, 932 transitions, 1877 flow [2025-03-13 22:23:48,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=921, 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=923, PETRI_TRANSITIONS=932} [2025-03-13 22:23:48,695 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2025-03-13 22:23:48,695 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 932 transitions, 1877 flow [2025-03-13 22:23:48,696 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-13 22:23:48,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:48,696 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-13 22:23:48,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:23:48,696 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:23:48,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1637194302, now seen corresponding path program 1 times [2025-03-13 22:23:48,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:48,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795525273] [2025-03-13 22:23:48,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:23:48,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:48,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-13 22:23:48,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-13 22:23:48,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:23:48,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:23:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795525273] [2025-03-13 22:23:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795525273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:23:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:23:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:23:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114758844] [2025-03-13 22:23:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:23:48,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:23:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:23:48,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:23:48,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:23:49,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-03-13 22:23:49,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:23:49,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:23:49,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-03-13 22:23:49,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:03,005 INFO L124 PetriNetUnfolderBase]: 15257/85346 cut-off events. [2025-03-13 22:24:03,005 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-13 22:24:03,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107775 conditions, 85346 events. 15257/85346 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 1263460 event pairs, 14040 based on Foata normal form. 0/74614 useless extension candidates. Maximal degree in co-relation 107733. Up to 22035 conditions per place. [2025-03-13 22:24:03,608 INFO L140 encePairwiseOnDemand]: 1033/1042 looper letters, 96 selfloop transitions, 6 changer transitions 0/929 dead transitions. [2025-03-13 22:24:03,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 929 transitions, 2075 flow [2025-03-13 22:24:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2844 transitions. [2025-03-13 22:24:03,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097888675623801 [2025-03-13 22:24:03,611 INFO L175 Difference]: Start difference. First operand has 923 places, 932 transitions, 1877 flow. Second operand 3 states and 2844 transitions. [2025-03-13 22:24:03,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 929 transitions, 2075 flow [2025-03-13 22:24:03,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 920 places, 929 transitions, 2071 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:03,618 INFO L231 Difference]: Finished difference. Result has 920 places, 929 transitions, 1879 flow [2025-03-13 22:24:03,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=920, PETRI_TRANSITIONS=929} [2025-03-13 22:24:03,619 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -68 predicate places. [2025-03-13 22:24:03,619 INFO L471 AbstractCegarLoop]: Abstraction has has 920 places, 929 transitions, 1879 flow [2025-03-13 22:24:03,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:03,620 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-13 22:24:03,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:24:03,620 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:03,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -284491298, now seen corresponding path program 1 times [2025-03-13 22:24:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:03,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741593658] [2025-03-13 22:24:03,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:03,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-13 22:24:03,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-13 22:24:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:03,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:03,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741593658] [2025-03-13 22:24:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741593658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:03,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641983767] [2025-03-13 22:24:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:03,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:03,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:03,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-13 22:24:03,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 920 places, 929 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:03,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-13 22:24:03,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:03,838 INFO L124 PetriNetUnfolderBase]: 29/1234 cut-off events. [2025-03-13 22:24:03,838 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-03-13 22:24:03,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 1234 events. 29/1234 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3908 event pairs, 5 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 1244. Up to 22 conditions per place. [2025-03-13 22:24:03,854 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/928 dead transitions. [2025-03-13 22:24:03,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 928 transitions, 1903 flow [2025-03-13 22:24:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-13 22:24:03,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-13 22:24:03,857 INFO L175 Difference]: Start difference. First operand has 920 places, 929 transitions, 1879 flow. Second operand 3 states and 3023 transitions. [2025-03-13 22:24:03,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 928 transitions, 1903 flow [2025-03-13 22:24:03,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 928 transitions, 1891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:03,865 INFO L231 Difference]: Finished difference. Result has 919 places, 928 transitions, 1869 flow [2025-03-13 22:24:03,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=917, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=926, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1869, PETRI_PLACES=919, PETRI_TRANSITIONS=928} [2025-03-13 22:24:03,866 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -69 predicate places. [2025-03-13 22:24:03,867 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 928 transitions, 1869 flow [2025-03-13 22:24:03,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:03,868 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-13 22:24:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:24:03,868 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:03,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 493868067, now seen corresponding path program 1 times [2025-03-13 22:24:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909300083] [2025-03-13 22:24:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:03,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-13 22:24:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-13 22:24:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:03,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909300083] [2025-03-13 22:24:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909300083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:03,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:03,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256746909] [2025-03-13 22:24:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:03,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:03,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:03,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-13 22:24:03,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 928 transitions, 1869 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:03,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:03,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-13 22:24:03,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:04,141 INFO L124 PetriNetUnfolderBase]: 37/1530 cut-off events. [2025-03-13 22:24:04,141 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-03-13 22:24:04,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 1530 events. 37/1530 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5648 event pairs, 7 based on Foata normal form. 0/1344 useless extension candidates. Maximal degree in co-relation 1528. Up to 25 conditions per place. [2025-03-13 22:24:04,160 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/927 dead transitions. [2025-03-13 22:24:04,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 920 places, 927 transitions, 1893 flow [2025-03-13 22:24:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-13 22:24:04,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-13 22:24:04,162 INFO L175 Difference]: Start difference. First operand has 919 places, 928 transitions, 1869 flow. Second operand 3 states and 3023 transitions. [2025-03-13 22:24:04,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 920 places, 927 transitions, 1893 flow [2025-03-13 22:24:04,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 918 places, 927 transitions, 1889 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:04,170 INFO L231 Difference]: Finished difference. Result has 918 places, 927 transitions, 1867 flow [2025-03-13 22:24:04,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=918, PETRI_TRANSITIONS=927} [2025-03-13 22:24:04,171 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -70 predicate places. [2025-03-13 22:24:04,171 INFO L471 AbstractCegarLoop]: Abstraction has has 918 places, 927 transitions, 1867 flow [2025-03-13 22:24:04,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:04,172 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-13 22:24:04,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:24:04,172 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:04,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:04,173 INFO L85 PathProgramCache]: Analyzing trace with hash 348330791, now seen corresponding path program 1 times [2025-03-13 22:24:04,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:04,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207216368] [2025-03-13 22:24:04,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:04,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:04,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-13 22:24:04,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-13 22:24:04,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:04,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207216368] [2025-03-13 22:24:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207216368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:04,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:04,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322940970] [2025-03-13 22:24:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:04,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:04,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:04,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:04,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:04,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-13 22:24:04,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 927 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:04,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-13 22:24:04,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:04,492 INFO L124 PetriNetUnfolderBase]: 33/1272 cut-off events. [2025-03-13 22:24:04,492 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-13 22:24:04,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 1272 events. 33/1272 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3657 event pairs, 7 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1268. Up to 26 conditions per place. [2025-03-13 22:24:04,507 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2025-03-13 22:24:04,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 926 transitions, 1891 flow [2025-03-13 22:24:04,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-13 22:24:04,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-13 22:24:04,510 INFO L175 Difference]: Start difference. First operand has 918 places, 927 transitions, 1867 flow. Second operand 3 states and 3023 transitions. [2025-03-13 22:24:04,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 926 transitions, 1891 flow [2025-03-13 22:24:04,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 926 transitions, 1887 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:04,517 INFO L231 Difference]: Finished difference. Result has 917 places, 926 transitions, 1865 flow [2025-03-13 22:24:04,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1861, PETRI_DIFFERENCE_MINUEND_PLACES=915, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1865, PETRI_PLACES=917, PETRI_TRANSITIONS=926} [2025-03-13 22:24:04,519 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -71 predicate places. [2025-03-13 22:24:04,519 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 926 transitions, 1865 flow [2025-03-13 22:24:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:04,520 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-13 22:24:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:24:04,520 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:04,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:04,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1774236917, now seen corresponding path program 1 times [2025-03-13 22:24:04,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:04,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237988574] [2025-03-13 22:24:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:04,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-13 22:24:04,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-13 22:24:04,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:04,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:04,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:04,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237988574] [2025-03-13 22:24:04,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237988574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:04,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:04,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783024238] [2025-03-13 22:24:04,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:04,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:04,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:04,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:04,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:04,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 999 out of 1042 [2025-03-13 22:24:04,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 926 transitions, 1865 flow. Second operand has 3 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:04,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 999 of 1042 [2025-03-13 22:24:04,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:04,885 INFO L124 PetriNetUnfolderBase]: 72/2066 cut-off events. [2025-03-13 22:24:04,886 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-13 22:24:04,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 2066 events. 72/2066 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10628 event pairs, 20 based on Foata normal form. 0/1821 useless extension candidates. Maximal degree in co-relation 2126. Up to 79 conditions per place. [2025-03-13 22:24:04,926 INFO L140 encePairwiseOnDemand]: 1036/1042 looper letters, 17 selfloop transitions, 2 changer transitions 0/926 dead transitions. [2025-03-13 22:24:04,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 926 transitions, 1905 flow [2025-03-13 22:24:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3020 transitions. [2025-03-13 22:24:04,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9660908509277031 [2025-03-13 22:24:04,928 INFO L175 Difference]: Start difference. First operand has 917 places, 926 transitions, 1865 flow. Second operand 3 states and 3020 transitions. [2025-03-13 22:24:04,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 926 transitions, 1905 flow [2025-03-13 22:24:04,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 913 places, 926 transitions, 1901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:04,940 INFO L231 Difference]: Finished difference. Result has 914 places, 924 transitions, 1867 flow [2025-03-13 22:24:04,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=911, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1867, PETRI_PLACES=914, PETRI_TRANSITIONS=924} [2025-03-13 22:24:04,941 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -74 predicate places. [2025-03-13 22:24:04,941 INFO L471 AbstractCegarLoop]: Abstraction has has 914 places, 924 transitions, 1867 flow [2025-03-13 22:24:04,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1000.3333333333334) internal successors, (3001), 3 states have internal predecessors, (3001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:04,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:04,942 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] [2025-03-13 22:24:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:24:04,942 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:04,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1205127108, now seen corresponding path program 1 times [2025-03-13 22:24:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759939336] [2025-03-13 22:24:04,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:04,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-13 22:24:04,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-13 22:24:04,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:04,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:05,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759939336] [2025-03-13 22:24:05,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759939336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:05,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:05,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:24:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448025219] [2025-03-13 22:24:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:05,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:24:05,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:05,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:24:05,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:24:05,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 999 out of 1042 [2025-03-13 22:24:05,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 914 places, 924 transitions, 1867 flow. Second operand has 3 states, 3 states have (on average 1000.6666666666666) internal successors, (3002), 3 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:05,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:05,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 999 of 1042 [2025-03-13 22:24:05,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:05,506 INFO L124 PetriNetUnfolderBase]: 137/3735 cut-off events. [2025-03-13 22:24:05,506 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-03-13 22:24:05,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3915 conditions, 3735 events. 137/3735 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 27642 event pairs, 49 based on Foata normal form. 0/3260 useless extension candidates. Maximal degree in co-relation 3873. Up to 125 conditions per place. [2025-03-13 22:24:05,559 INFO L140 encePairwiseOnDemand]: 1036/1042 looper letters, 17 selfloop transitions, 2 changer transitions 0/924 dead transitions. [2025-03-13 22:24:05,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 912 places, 924 transitions, 1907 flow [2025-03-13 22:24:05,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:24:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:24:05,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3020 transitions. [2025-03-13 22:24:05,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9660908509277031 [2025-03-13 22:24:05,561 INFO L175 Difference]: Start difference. First operand has 914 places, 924 transitions, 1867 flow. Second operand 3 states and 3020 transitions. [2025-03-13 22:24:05,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 912 places, 924 transitions, 1907 flow [2025-03-13 22:24:05,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 912 places, 924 transitions, 1907 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:05,570 INFO L231 Difference]: Finished difference. Result has 913 places, 922 transitions, 1873 flow [2025-03-13 22:24:05,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=910, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=918, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1873, PETRI_PLACES=913, PETRI_TRANSITIONS=922} [2025-03-13 22:24:05,571 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -75 predicate places. [2025-03-13 22:24:05,571 INFO L471 AbstractCegarLoop]: Abstraction has has 913 places, 922 transitions, 1873 flow [2025-03-13 22:24:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1000.6666666666666) internal successors, (3002), 3 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:05,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:05,572 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-13 22:24:05,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:24:05,572 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:05,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1894779025, now seen corresponding path program 1 times [2025-03-13 22:24:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:05,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-03-13 22:24:05,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:05,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-03-13 22:24:05,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-03-13 22:24:05,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:05,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:05,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-03-13 22:24:05,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019529613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:05,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:24:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039708291] [2025-03-13 22:24:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:24:05,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:05,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:24:05,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:24:06,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 976 out of 1042 [2025-03-13 22:24:06,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 913 places, 922 transitions, 1873 flow. Second operand has 7 states, 7 states have (on average 980.4285714285714) internal successors, (6863), 7 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:06,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:06,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 976 of 1042 [2025-03-13 22:24:06,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:06,689 INFO L124 PetriNetUnfolderBase]: 50/2227 cut-off events. [2025-03-13 22:24:06,689 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-03-13 22:24:06,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 2227 events. 50/2227 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 11231 event pairs, 0 based on Foata normal form. 1/2005 useless extension candidates. Maximal degree in co-relation 2296. Up to 40 conditions per place. [2025-03-13 22:24:06,736 INFO L140 encePairwiseOnDemand]: 1032/1042 looper letters, 67 selfloop transitions, 9 changer transitions 0/957 dead transitions. [2025-03-13 22:24:06,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 957 transitions, 2101 flow [2025-03-13 22:24:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 22:24:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 22:24:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6909 transitions. [2025-03-13 22:24:06,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9472168905950096 [2025-03-13 22:24:06,742 INFO L175 Difference]: Start difference. First operand has 913 places, 922 transitions, 1873 flow. Second operand 7 states and 6909 transitions. [2025-03-13 22:24:06,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 957 transitions, 2101 flow [2025-03-13 22:24:06,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 957 transitions, 2101 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:24:06,753 INFO L231 Difference]: Finished difference. Result has 923 places, 928 transitions, 1930 flow [2025-03-13 22:24:06,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=913, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=922, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=913, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1930, PETRI_PLACES=923, PETRI_TRANSITIONS=928} [2025-03-13 22:24:06,755 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2025-03-13 22:24:06,755 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 928 transitions, 1930 flow [2025-03-13 22:24:06,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 980.4285714285714) internal successors, (6863), 7 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:06,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:06,757 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-13 22:24:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:24:06,757 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:06,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1029164713, now seen corresponding path program 1 times [2025-03-13 22:24:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118979129] [2025-03-13 22:24:06,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:06,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-13 22:24:06,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-13 22:24:06,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118979129] [2025-03-13 22:24:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118979129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:07,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:07,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 22:24:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570301224] [2025-03-13 22:24:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:07,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 22:24:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:07,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 22:24:07,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-13 22:24:07,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 971 out of 1042 [2025-03-13 22:24:07,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 928 transitions, 1930 flow. Second operand has 8 states, 8 states have (on average 975.375) internal successors, (7803), 8 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:07,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:07,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 971 of 1042 [2025-03-13 22:24:07,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:24:08,167 INFO L124 PetriNetUnfolderBase]: 73/3263 cut-off events. [2025-03-13 22:24:08,167 INFO L125 PetriNetUnfolderBase]: For 31/40 co-relation queries the response was YES. [2025-03-13 22:24:08,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3476 conditions, 3263 events. 73/3263 cut-off events. For 31/40 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 20504 event pairs, 0 based on Foata normal form. 1/2932 useless extension candidates. Maximal degree in co-relation 3426. Up to 82 conditions per place. [2025-03-13 22:24:08,247 INFO L140 encePairwiseOnDemand]: 1029/1042 looper letters, 80 selfloop transitions, 13 changer transitions 0/969 dead transitions. [2025-03-13 22:24:08,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 969 transitions, 2218 flow [2025-03-13 22:24:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:24:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:24:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8827 transitions. [2025-03-13 22:24:08,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412454681168693 [2025-03-13 22:24:08,254 INFO L175 Difference]: Start difference. First operand has 923 places, 928 transitions, 1930 flow. Second operand 9 states and 8827 transitions. [2025-03-13 22:24:08,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 969 transitions, 2218 flow [2025-03-13 22:24:08,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 969 transitions, 2213 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:24:08,266 INFO L231 Difference]: Finished difference. Result has 936 places, 939 transitions, 2019 flow [2025-03-13 22:24:08,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=928, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2019, PETRI_PLACES=936, PETRI_TRANSITIONS=939} [2025-03-13 22:24:08,268 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2025-03-13 22:24:08,268 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 939 transitions, 2019 flow [2025-03-13 22:24:08,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 975.375) internal successors, (7803), 8 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:08,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:24:08,271 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-13 22:24:08,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:24:08,271 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-13 22:24:08,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:24:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash 522158197, now seen corresponding path program 1 times [2025-03-13 22:24:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:24:08,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243690806] [2025-03-13 22:24:08,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:24:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:24:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-03-13 22:24:08,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-03-13 22:24:08,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:24:08,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:24:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:24:08,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:24:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243690806] [2025-03-13 22:24:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243690806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:24:08,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:24:08,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:24:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786608237] [2025-03-13 22:24:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:24:08,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:24:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:24:08,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:24:08,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:24:09,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 969 out of 1042 [2025-03-13 22:24:09,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 939 transitions, 2019 flow. Second operand has 6 states, 6 states have (on average 970.6666666666666) internal successors, (5824), 6 states have internal predecessors, (5824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:24:09,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:24:09,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 969 of 1042 [2025-03-13 22:24:09,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand