./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i -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 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:48:10,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:48:10,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:48:10,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:48:10,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:48:10,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:48:10,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:48:10,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:48:10,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:48:10,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:48:10,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:48:10,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:48:10,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:48:10,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:48:10,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:48:10,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:48:10,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:48:10,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:48:10,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:48:10,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:48:10,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:48:10,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:48:10,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:48:10,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:48:10,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:48:10,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:48:10,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:48:10,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:48:10,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:48:10,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:48:10,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:48:10,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:48:10,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:48:10,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:48:10,276 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 -> 446ad788bb04ab307771e8b8b2d959cead97e99c160d020f0d1d03b043f9ed25 [2025-03-14 01:48:10,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:48:10,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:48:10,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:48:10,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:48:10,507 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:48:10,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2025-03-14 01:48:11,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8e55b50/376546e583cc434493c64a3adf9f7244/FLAGaa97453f7 [2025-03-14 01:48:12,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:48:12,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2025-03-14 01:48:12,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8e55b50/376546e583cc434493c64a3adf9f7244/FLAGaa97453f7 [2025-03-14 01:48:12,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8e55b50/376546e583cc434493c64a3adf9f7244 [2025-03-14 01:48:12,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:48:12,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:48:12,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:48:12,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:48:12,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:48:12,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5be5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12, skipping insertion in model container [2025-03-14 01:48:12,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:48:12,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:48:12,619 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:48:12,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:48:12,715 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:48:12,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12 WrapperNode [2025-03-14 01:48:12,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:48:12,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:48:12,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:48:12,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:48:12,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,751 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2025-03-14 01:48:12,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:48:12,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:48:12,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:48:12,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:48:12,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,768 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,784 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:48:12,801 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:48:12,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:48:12,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:48:12,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (1/1) ... [2025-03-14 01:48:12,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:48:12,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:48:12,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:48:12,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:48:12,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:48:12,850 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:48:12,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:48:12,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:48:12,850 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:48:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:48:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:48:12,851 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-03-14 01:48:12,852 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-03-14 01:48:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:48:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:48:12,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:48:12,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:48:12,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:48:12,853 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:48:12,999 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:48:13,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:48:13,481 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:48:13,482 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:48:13,482 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:48:13,521 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:48:13,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:48:13 BoogieIcfgContainer [2025-03-14 01:48:13,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:48:13,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:48:13,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:48:13,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:48:13,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:48:12" (1/3) ... [2025-03-14 01:48:13,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fba968b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:48:13, skipping insertion in model container [2025-03-14 01:48:13,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:48:12" (2/3) ... [2025-03-14 01:48:13,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fba968b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:48:13, skipping insertion in model container [2025-03-14 01:48:13,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:48:13" (3/3) ... [2025-03-14 01:48:13,549 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2025-03-14 01:48:13,561 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:48:13,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter.i that has 3 procedures, 386 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2025-03-14 01:48:13,563 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:48:13,639 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:48:13,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 467 transitions, 948 flow [2025-03-14 01:48:13,910 INFO L124 PetriNetUnfolderBase]: 19/586 cut-off events. [2025-03-14 01:48:13,912 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:48:13,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 586 events. 19/586 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 979 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 374. Up to 6 conditions per place. [2025-03-14 01:48:13,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 467 transitions, 948 flow [2025-03-14 01:48:13,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 395 transitions, 800 flow [2025-03-14 01:48:13,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:48:13,964 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;@3dd8fa6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:48:13,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-14 01:48:13,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:48:13,991 INFO L124 PetriNetUnfolderBase]: 0/148 cut-off events. [2025-03-14 01:48:13,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:48:13,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:13,992 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] [2025-03-14 01:48:13,995 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1663180944, now seen corresponding path program 1 times [2025-03-14 01:48:14,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910959089] [2025-03-14 01:48:14,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:14,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-14 01:48:14,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-14 01:48:14,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:14,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910959089] [2025-03-14 01:48:14,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910959089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160269703] [2025-03-14 01:48:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:14,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:14,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:14,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:14,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-03-14 01:48:14,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:14,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:14,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-03-14 01:48:14,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:15,444 INFO L124 PetriNetUnfolderBase]: 654/4276 cut-off events. [2025-03-14 01:48:15,444 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:48:15,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 4276 events. 654/4276 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 33137 event pairs, 489 based on Foata normal form. 182/3765 useless extension candidates. Maximal degree in co-relation 5080. Up to 1006 conditions per place. [2025-03-14 01:48:15,478 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 28 selfloop transitions, 2 changer transitions 1/386 dead transitions. [2025-03-14 01:48:15,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 842 flow [2025-03-14 01:48:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-03-14 01:48:15,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-03-14 01:48:15,499 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 800 flow. Second operand 3 states and 1303 transitions. [2025-03-14 01:48:15,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 842 flow [2025-03-14 01:48:15,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:48:15,518 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 783 flow [2025-03-14 01:48:15,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=388, PETRI_TRANSITIONS=385} [2025-03-14 01:48:15,526 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -3 predicate places. [2025-03-14 01:48:15,526 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 783 flow [2025-03-14 01:48:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:15,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:15,528 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] [2025-03-14 01:48:15,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:48:15,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:15,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash 878921608, now seen corresponding path program 1 times [2025-03-14 01:48:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209794940] [2025-03-14 01:48:15,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:15,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:48:15,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:48:15,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:15,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209794940] [2025-03-14 01:48:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209794940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291345846] [2025-03-14 01:48:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:15,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:15,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:15,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 467 [2025-03-14 01:48:15,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 385 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:15,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:15,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 467 [2025-03-14 01:48:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:16,288 INFO L124 PetriNetUnfolderBase]: 760/4471 cut-off events. [2025-03-14 01:48:16,289 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-14 01:48:16,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5685 conditions, 4471 events. 760/4471 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 34822 event pairs, 564 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 5528. Up to 1180 conditions per place. [2025-03-14 01:48:16,310 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 31 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2025-03-14 01:48:16,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 833 flow [2025-03-14 01:48:16,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-03-14 01:48:16,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100642398286938 [2025-03-14 01:48:16,313 INFO L175 Difference]: Start difference. First operand has 388 places, 385 transitions, 783 flow. Second operand 3 states and 1275 transitions. [2025-03-14 01:48:16,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 833 flow [2025-03-14 01:48:16,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:16,317 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 767 flow [2025-03-14 01:48:16,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2025-03-14 01:48:16,318 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-03-14 01:48:16,319 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 767 flow [2025-03-14 01:48:16,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:16,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:16,319 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] [2025-03-14 01:48:16,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:48:16,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:16,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash -345381808, now seen corresponding path program 1 times [2025-03-14 01:48:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:16,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17307258] [2025-03-14 01:48:16,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:16,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:16,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-14 01:48:16,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-14 01:48:16,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:16,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:16,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17307258] [2025-03-14 01:48:16,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17307258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:16,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:16,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:16,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448334927] [2025-03-14 01:48:16,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:16,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:16,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:16,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:16,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 467 [2025-03-14 01:48:16,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:16,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:16,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 467 [2025-03-14 01:48:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:17,034 INFO L124 PetriNetUnfolderBase]: 709/4509 cut-off events. [2025-03-14 01:48:17,035 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-14 01:48:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5643 conditions, 4509 events. 709/4509 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 36431 event pairs, 546 based on Foata normal form. 0/3831 useless extension candidates. Maximal degree in co-relation 5486. Up to 1102 conditions per place. [2025-03-14 01:48:17,077 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-03-14 01:48:17,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 817 flow [2025-03-14 01:48:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2025-03-14 01:48:17,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314775160599572 [2025-03-14 01:48:17,081 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 767 flow. Second operand 3 states and 1305 transitions. [2025-03-14 01:48:17,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 817 flow [2025-03-14 01:48:17,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:48:17,088 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2025-03-14 01:48:17,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2025-03-14 01:48:17,089 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-03-14 01:48:17,089 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2025-03-14 01:48:17,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:17,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:17,090 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:17,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:48:17,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:17,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash -9108242, now seen corresponding path program 1 times [2025-03-14 01:48:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:17,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309045274] [2025-03-14 01:48:17,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:17,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-14 01:48:17,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-14 01:48:17,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:17,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:17,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:17,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309045274] [2025-03-14 01:48:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309045274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013365045] [2025-03-14 01:48:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:17,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:17,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:17,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-03-14 01:48:17,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:17,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:17,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-03-14 01:48:17,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:17,758 INFO L124 PetriNetUnfolderBase]: 835/4382 cut-off events. [2025-03-14 01:48:17,759 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-14 01:48:17,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 4382 events. 835/4382 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 33687 event pairs, 605 based on Foata normal form. 0/3744 useless extension candidates. Maximal degree in co-relation 5523. Up to 1258 conditions per place. [2025-03-14 01:48:17,785 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-03-14 01:48:17,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 818 flow [2025-03-14 01:48:17,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-03-14 01:48:17,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2025-03-14 01:48:17,788 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1302 transitions. [2025-03-14 01:48:17,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 818 flow [2025-03-14 01:48:17,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:17,792 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2025-03-14 01:48:17,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=379, PETRI_TRANSITIONS=376} [2025-03-14 01:48:17,793 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -12 predicate places. [2025-03-14 01:48:17,794 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2025-03-14 01:48:17,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:17,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:17,795 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] [2025-03-14 01:48:17,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:48:17,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:17,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash -884884871, now seen corresponding path program 1 times [2025-03-14 01:48:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745854964] [2025-03-14 01:48:17,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-14 01:48:17,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-14 01:48:17,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:17,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:17,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745854964] [2025-03-14 01:48:17,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745854964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:17,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:17,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696516222] [2025-03-14 01:48:17,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:17,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:17,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:17,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:17,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:17,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2025-03-14 01:48:17,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:17,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:17,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2025-03-14 01:48:17,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:18,374 INFO L124 PetriNetUnfolderBase]: 991/4610 cut-off events. [2025-03-14 01:48:18,374 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-14 01:48:18,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 4610 events. 991/4610 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 36141 event pairs, 713 based on Foata normal form. 0/3944 useless extension candidates. Maximal degree in co-relation 5970. Up to 1475 conditions per place. [2025-03-14 01:48:18,405 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-03-14 01:48:18,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 820 flow [2025-03-14 01:48:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-03-14 01:48:18,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-03-14 01:48:18,408 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1298 transitions. [2025-03-14 01:48:18,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 820 flow [2025-03-14 01:48:18,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:18,414 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2025-03-14 01:48:18,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2025-03-14 01:48:18,417 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-03-14 01:48:18,417 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2025-03-14 01:48:18,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:18,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:18,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:48:18,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:18,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1904047258, now seen corresponding path program 1 times [2025-03-14 01:48:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673430114] [2025-03-14 01:48:18,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:18,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-14 01:48:18,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-14 01:48:18,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:18,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:18,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:18,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673430114] [2025-03-14 01:48:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673430114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196724581] [2025-03-14 01:48:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:18,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 467 [2025-03-14 01:48:18,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:18,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:18,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 467 [2025-03-14 01:48:18,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:19,066 INFO L124 PetriNetUnfolderBase]: 1451/5118 cut-off events. [2025-03-14 01:48:19,066 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-14 01:48:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7312 conditions, 5118 events. 1451/5118 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 38982 event pairs, 507 based on Foata normal form. 0/4533 useless extension candidates. Maximal degree in co-relation 7156. Up to 2100 conditions per place. [2025-03-14 01:48:19,114 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 38 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-03-14 01:48:19,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 383 transitions, 867 flow [2025-03-14 01:48:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-03-14 01:48:19,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214846538187009 [2025-03-14 01:48:19,118 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1291 transitions. [2025-03-14 01:48:19,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 383 transitions, 867 flow [2025-03-14 01:48:19,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:19,124 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 771 flow [2025-03-14 01:48:19,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-03-14 01:48:19,126 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-03-14 01:48:19,126 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 771 flow [2025-03-14 01:48:19,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:19,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:19,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:19,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:48:19,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -236173258, now seen corresponding path program 1 times [2025-03-14 01:48:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598622369] [2025-03-14 01:48:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:19,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-14 01:48:19,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-14 01:48:19,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:19,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598622369] [2025-03-14 01:48:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598622369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853038009] [2025-03-14 01:48:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:19,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:19,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:19,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2025-03-14 01:48:19,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:19,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:19,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2025-03-14 01:48:19,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:19,829 INFO L124 PetriNetUnfolderBase]: 958/5597 cut-off events. [2025-03-14 01:48:19,829 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-14 01:48:19,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7278 conditions, 5597 events. 958/5597 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 48302 event pairs, 625 based on Foata normal form. 0/4978 useless extension candidates. Maximal degree in co-relation 7122. Up to 1485 conditions per place. [2025-03-14 01:48:19,863 INFO L140 encePairwiseOnDemand]: 461/467 looper letters, 30 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2025-03-14 01:48:19,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 379 transitions, 849 flow [2025-03-14 01:48:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-03-14 01:48:19,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9336188436830836 [2025-03-14 01:48:19,866 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 771 flow. Second operand 3 states and 1308 transitions. [2025-03-14 01:48:19,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 379 transitions, 849 flow [2025-03-14 01:48:19,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:19,870 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 786 flow [2025-03-14 01:48:19,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-03-14 01:48:19,871 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-03-14 01:48:19,871 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 786 flow [2025-03-14 01:48:19,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:19,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:19,872 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] [2025-03-14 01:48:19,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:48:19,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting cleanerErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1270189782, now seen corresponding path program 1 times [2025-03-14 01:48:19,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:19,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069864288] [2025-03-14 01:48:19,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:19,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-14 01:48:19,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-14 01:48:19,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:19,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:19,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069864288] [2025-03-14 01:48:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069864288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:19,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:19,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414828639] [2025-03-14 01:48:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:19,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:19,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:19,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:19,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2025-03-14 01:48:19,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:19,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:19,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2025-03-14 01:48:19,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:20,590 INFO L124 PetriNetUnfolderBase]: 1295/5778 cut-off events. [2025-03-14 01:48:20,590 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-14 01:48:20,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7852 conditions, 5778 events. 1295/5778 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 47164 event pairs, 516 based on Foata normal form. 0/5163 useless extension candidates. Maximal degree in co-relation 7695. Up to 1640 conditions per place. [2025-03-14 01:48:20,627 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 35 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-14 01:48:20,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 883 flow [2025-03-14 01:48:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-03-14 01:48:20,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-03-14 01:48:20,630 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 786 flow. Second operand 3 states and 1303 transitions. [2025-03-14 01:48:20,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 883 flow [2025-03-14 01:48:20,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 883 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:20,634 INFO L231 Difference]: Finished difference. Result has 374 places, 372 transitions, 794 flow [2025-03-14 01:48:20,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=374, PETRI_TRANSITIONS=372} [2025-03-14 01:48:20,635 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-03-14 01:48:20,635 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 372 transitions, 794 flow [2025-03-14 01:48:20,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:20,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:20,636 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] [2025-03-14 01:48:20,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:48:20,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:20,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:20,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1134430048, now seen corresponding path program 1 times [2025-03-14 01:48:20,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:20,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316619786] [2025-03-14 01:48:20,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:20,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-14 01:48:20,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-14 01:48:20,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:20,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316619786] [2025-03-14 01:48:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316619786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189655704] [2025-03-14 01:48:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:20,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:20,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:20,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-03-14 01:48:20,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 372 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:20,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:20,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-03-14 01:48:20,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:21,602 INFO L124 PetriNetUnfolderBase]: 1912/8861 cut-off events. [2025-03-14 01:48:21,602 INFO L125 PetriNetUnfolderBase]: For 81/89 co-relation queries the response was YES. [2025-03-14 01:48:21,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12334 conditions, 8861 events. 1912/8861 cut-off events. For 81/89 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 78643 event pairs, 714 based on Foata normal form. 0/7856 useless extension candidates. Maximal degree in co-relation 12176. Up to 1548 conditions per place. [2025-03-14 01:48:21,738 INFO L140 encePairwiseOnDemand]: 456/467 looper letters, 44 selfloop transitions, 8 changer transitions 0/396 dead transitions. [2025-03-14 01:48:21,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 396 transitions, 952 flow [2025-03-14 01:48:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-03-14 01:48:21,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-03-14 01:48:21,741 INFO L175 Difference]: Start difference. First operand has 374 places, 372 transitions, 794 flow. Second operand 3 states and 1321 transitions. [2025-03-14 01:48:21,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 396 transitions, 952 flow [2025-03-14 01:48:21,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 396 transitions, 952 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:21,746 INFO L231 Difference]: Finished difference. Result has 378 places, 380 transitions, 864 flow [2025-03-14 01:48:21,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=378, PETRI_TRANSITIONS=380} [2025-03-14 01:48:21,747 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-03-14 01:48:21,747 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 380 transitions, 864 flow [2025-03-14 01:48:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:21,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:21,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:21,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:48:21,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:21,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1562746990, now seen corresponding path program 1 times [2025-03-14 01:48:21,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:21,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85270551] [2025-03-14 01:48:21,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:21,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:48:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:48:21,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85270551] [2025-03-14 01:48:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85270551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352522286] [2025-03-14 01:48:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:21,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:22,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-03-14 01:48:22,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 380 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:22,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:22,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-03-14 01:48:22,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:24,569 INFO L124 PetriNetUnfolderBase]: 4584/20498 cut-off events. [2025-03-14 01:48:24,569 INFO L125 PetriNetUnfolderBase]: For 380/388 co-relation queries the response was YES. [2025-03-14 01:48:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29478 conditions, 20498 events. 4584/20498 cut-off events. For 380/388 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 220354 event pairs, 2480 based on Foata normal form. 0/18591 useless extension candidates. Maximal degree in co-relation 29317. Up to 5342 conditions per place. [2025-03-14 01:48:24,686 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 45 selfloop transitions, 9 changer transitions 0/403 dead transitions. [2025-03-14 01:48:24,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 403 transitions, 1024 flow [2025-03-14 01:48:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:24,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-03-14 01:48:24,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-03-14 01:48:24,689 INFO L175 Difference]: Start difference. First operand has 378 places, 380 transitions, 864 flow. Second operand 3 states and 1321 transitions. [2025-03-14 01:48:24,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 403 transitions, 1024 flow [2025-03-14 01:48:24,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 403 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:24,696 INFO L231 Difference]: Finished difference. Result has 380 places, 388 transitions, 918 flow [2025-03-14 01:48:24,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=380, PETRI_TRANSITIONS=388} [2025-03-14 01:48:24,697 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-03-14 01:48:24,697 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 388 transitions, 918 flow [2025-03-14 01:48:24,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:24,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:24,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:48:24,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:24,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1893321855, now seen corresponding path program 1 times [2025-03-14 01:48:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712744861] [2025-03-14 01:48:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:24,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-14 01:48:24,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-14 01:48:24,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:24,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712744861] [2025-03-14 01:48:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712744861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525955253] [2025-03-14 01:48:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:48:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:24,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:48:24,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:48:25,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-03-14 01:48:25,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 388 transitions, 918 flow. Second operand has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:25,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:25,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-03-14 01:48:25,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:27,119 INFO L124 PetriNetUnfolderBase]: 2608/15740 cut-off events. [2025-03-14 01:48:27,119 INFO L125 PetriNetUnfolderBase]: For 512/576 co-relation queries the response was YES. [2025-03-14 01:48:27,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22205 conditions, 15740 events. 2608/15740 cut-off events. For 512/576 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 172010 event pairs, 1917 based on Foata normal form. 4/14290 useless extension candidates. Maximal degree in co-relation 22041. Up to 3513 conditions per place. [2025-03-14 01:48:27,206 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 36 selfloop transitions, 8 changer transitions 0/402 dead transitions. [2025-03-14 01:48:27,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 402 transitions, 1033 flow [2025-03-14 01:48:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2595 transitions. [2025-03-14 01:48:27,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261241970021413 [2025-03-14 01:48:27,211 INFO L175 Difference]: Start difference. First operand has 380 places, 388 transitions, 918 flow. Second operand 6 states and 2595 transitions. [2025-03-14 01:48:27,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 402 transitions, 1033 flow [2025-03-14 01:48:27,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 402 transitions, 1015 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:27,223 INFO L231 Difference]: Finished difference. Result has 387 places, 392 transitions, 945 flow [2025-03-14 01:48:27,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=387, PETRI_TRANSITIONS=392} [2025-03-14 01:48:27,224 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -4 predicate places. [2025-03-14 01:48:27,225 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 392 transitions, 945 flow [2025-03-14 01:48:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:27,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:27,226 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] [2025-03-14 01:48:27,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:48:27,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 267553888, now seen corresponding path program 1 times [2025-03-14 01:48:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562413921] [2025-03-14 01:48:27,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-14 01:48:27,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-14 01:48:27,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:27,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:27,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562413921] [2025-03-14 01:48:27,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562413921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:27,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:27,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:27,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678502840] [2025-03-14 01:48:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:27,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:27,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:27,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:27,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 433 out of 467 [2025-03-14 01:48:27,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 392 transitions, 945 flow. Second operand has 3 states, 3 states have (on average 434.6666666666667) internal successors, (1304), 3 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:27,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:27,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 433 of 467 [2025-03-14 01:48:27,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:29,303 INFO L124 PetriNetUnfolderBase]: 3149/16273 cut-off events. [2025-03-14 01:48:29,303 INFO L125 PetriNetUnfolderBase]: For 227/258 co-relation queries the response was YES. [2025-03-14 01:48:29,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23316 conditions, 16273 events. 3149/16273 cut-off events. For 227/258 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 175039 event pairs, 1835 based on Foata normal form. 2/14521 useless extension candidates. Maximal degree in co-relation 23148. Up to 3403 conditions per place. [2025-03-14 01:48:29,463 INFO L140 encePairwiseOnDemand]: 463/467 looper letters, 29 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2025-03-14 01:48:29,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 403 transitions, 1034 flow [2025-03-14 01:48:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1332 transitions. [2025-03-14 01:48:29,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507494646680942 [2025-03-14 01:48:29,465 INFO L175 Difference]: Start difference. First operand has 387 places, 392 transitions, 945 flow. Second operand 3 states and 1332 transitions. [2025-03-14 01:48:29,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 403 transitions, 1034 flow [2025-03-14 01:48:29,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 403 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:48:29,473 INFO L231 Difference]: Finished difference. Result has 390 places, 394 transitions, 963 flow [2025-03-14 01:48:29,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=963, PETRI_PLACES=390, PETRI_TRANSITIONS=394} [2025-03-14 01:48:29,476 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -1 predicate places. [2025-03-14 01:48:29,476 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 394 transitions, 963 flow [2025-03-14 01:48:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 434.6666666666667) internal successors, (1304), 3 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:29,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:29,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:29,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:48:29,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:29,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 369126424, now seen corresponding path program 1 times [2025-03-14 01:48:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:29,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213250630] [2025-03-14 01:48:29,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:29,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:29,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-14 01:48:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-14 01:48:29,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:29,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213250630] [2025-03-14 01:48:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213250630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316767391] [2025-03-14 01:48:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:29,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:48:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:29,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:48:29,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:48:29,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-03-14 01:48:29,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 394 transitions, 963 flow. Second operand has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:29,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:29,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-03-14 01:48:29,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:32,453 INFO L124 PetriNetUnfolderBase]: 3863/20086 cut-off events. [2025-03-14 01:48:32,454 INFO L125 PetriNetUnfolderBase]: For 736/768 co-relation queries the response was YES. [2025-03-14 01:48:32,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29485 conditions, 20086 events. 3863/20086 cut-off events. For 736/768 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 223547 event pairs, 2588 based on Foata normal form. 6/18309 useless extension candidates. Maximal degree in co-relation 29314. Up to 5213 conditions per place. [2025-03-14 01:48:32,580 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 27 selfloop transitions, 4 changer transitions 17/406 dead transitions. [2025-03-14 01:48:32,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 406 transitions, 1078 flow [2025-03-14 01:48:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2596 transitions. [2025-03-14 01:48:32,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-03-14 01:48:32,585 INFO L175 Difference]: Start difference. First operand has 390 places, 394 transitions, 963 flow. Second operand 6 states and 2596 transitions. [2025-03-14 01:48:32,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 406 transitions, 1078 flow [2025-03-14 01:48:32,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 406 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:32,596 INFO L231 Difference]: Finished difference. Result has 395 places, 389 transitions, 944 flow [2025-03-14 01:48:32,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=395, PETRI_TRANSITIONS=389} [2025-03-14 01:48:32,597 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 4 predicate places. [2025-03-14 01:48:32,597 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 389 transitions, 944 flow [2025-03-14 01:48:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:32,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:32,598 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:32,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:48:32,598 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash -918798755, now seen corresponding path program 1 times [2025-03-14 01:48:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886479865] [2025-03-14 01:48:32,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:32,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-14 01:48:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-14 01:48:32,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:32,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:48:33,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886479865] [2025-03-14 01:48:33,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886479865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:33,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938962723] [2025-03-14 01:48:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:33,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:33,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:33,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:33,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:33,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 467 [2025-03-14 01:48:33,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 389 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:33,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:33,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 467 [2025-03-14 01:48:33,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:38,084 INFO L124 PetriNetUnfolderBase]: 8808/34314 cut-off events. [2025-03-14 01:48:38,084 INFO L125 PetriNetUnfolderBase]: For 2631/3223 co-relation queries the response was YES. [2025-03-14 01:48:38,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55232 conditions, 34314 events. 8808/34314 cut-off events. For 2631/3223 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 397193 event pairs, 4842 based on Foata normal form. 4/30773 useless extension candidates. Maximal degree in co-relation 55057. Up to 11174 conditions per place. [2025-03-14 01:48:38,476 INFO L140 encePairwiseOnDemand]: 453/467 looper letters, 95 selfloop transitions, 46 changer transitions 0/485 dead transitions. [2025-03-14 01:48:38,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 485 transitions, 1500 flow [2025-03-14 01:48:38,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2579 transitions. [2025-03-14 01:48:38,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204139900071378 [2025-03-14 01:48:38,480 INFO L175 Difference]: Start difference. First operand has 395 places, 389 transitions, 944 flow. Second operand 6 states and 2579 transitions. [2025-03-14 01:48:38,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 485 transitions, 1500 flow [2025-03-14 01:48:38,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 485 transitions, 1472 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-03-14 01:48:38,494 INFO L231 Difference]: Finished difference. Result has 391 places, 434 transitions, 1251 flow [2025-03-14 01:48:38,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1251, PETRI_PLACES=391, PETRI_TRANSITIONS=434} [2025-03-14 01:48:38,495 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 0 predicate places. [2025-03-14 01:48:38,495 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 434 transitions, 1251 flow [2025-03-14 01:48:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:38,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:38,497 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:38,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:48:38,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2006076996, now seen corresponding path program 1 times [2025-03-14 01:48:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:38,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196453828] [2025-03-14 01:48:38,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:38,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-14 01:48:38,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-14 01:48:38,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:38,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:48:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196453828] [2025-03-14 01:48:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196453828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:48:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936818777] [2025-03-14 01:48:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:48:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:38,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:48:38,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:48:39,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 467 [2025-03-14 01:48:39,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 434 transitions, 1251 flow. Second operand has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:39,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:39,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 467 [2025-03-14 01:48:39,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:42,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][407], [Black: 478#true, Black: 513#(= |#race~data~0| 0), Black: 482#true, 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 66#L1042true, 459#true, Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 309#L1034true, 468#(= |#race~threads_total~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:42,254 INFO L294 olderBase$Statistics]: this new event has 316 ancestors and is cut-off event [2025-03-14 01:48:42,254 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-14 01:48:42,254 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-14 01:48:42,255 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-14 01:48:45,687 INFO L124 PetriNetUnfolderBase]: 9901/40836 cut-off events. [2025-03-14 01:48:45,687 INFO L125 PetriNetUnfolderBase]: For 3928/7003 co-relation queries the response was YES. [2025-03-14 01:48:45,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68073 conditions, 40836 events. 9901/40836 cut-off events. For 3928/7003 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 498590 event pairs, 4533 based on Foata normal form. 306/36960 useless extension candidates. Maximal degree in co-relation 67904. Up to 11018 conditions per place. [2025-03-14 01:48:46,062 INFO L140 encePairwiseOnDemand]: 455/467 looper letters, 64 selfloop transitions, 14 changer transitions 10/483 dead transitions. [2025-03-14 01:48:46,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 483 transitions, 1530 flow [2025-03-14 01:48:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:48:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:48:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4268 transitions. [2025-03-14 01:48:46,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139186295503212 [2025-03-14 01:48:46,067 INFO L175 Difference]: Start difference. First operand has 391 places, 434 transitions, 1251 flow. Second operand 10 states and 4268 transitions. [2025-03-14 01:48:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 483 transitions, 1530 flow [2025-03-14 01:48:46,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 483 transitions, 1530 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:46,081 INFO L231 Difference]: Finished difference. Result has 404 places, 441 transitions, 1318 flow [2025-03-14 01:48:46,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1318, PETRI_PLACES=404, PETRI_TRANSITIONS=441} [2025-03-14 01:48:46,082 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 13 predicate places. [2025-03-14 01:48:46,082 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 441 transitions, 1318 flow [2025-03-14 01:48:46,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:46,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:46,083 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:46,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:48:46,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -927907288, now seen corresponding path program 1 times [2025-03-14 01:48:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383633490] [2025-03-14 01:48:46,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:46,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-14 01:48:46,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-14 01:48:46,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:46,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:48:46,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:46,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383633490] [2025-03-14 01:48:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383633490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:46,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:48:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797036437] [2025-03-14 01:48:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:46,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:48:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:46,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:48:46,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:48:46,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2025-03-14 01:48:46,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 441 transitions, 1318 flow. Second operand has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:46,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:46,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2025-03-14 01:48:46,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:53,674 INFO L124 PetriNetUnfolderBase]: 11380/45966 cut-off events. [2025-03-14 01:48:53,674 INFO L125 PetriNetUnfolderBase]: For 15940/17458 co-relation queries the response was YES. [2025-03-14 01:48:54,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85905 conditions, 45966 events. 11380/45966 cut-off events. For 15940/17458 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 563026 event pairs, 3934 based on Foata normal form. 107/42315 useless extension candidates. Maximal degree in co-relation 85730. Up to 8316 conditions per place. [2025-03-14 01:48:54,187 INFO L140 encePairwiseOnDemand]: 454/467 looper letters, 101 selfloop transitions, 44 changer transitions 0/511 dead transitions. [2025-03-14 01:48:54,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 511 transitions, 1900 flow [2025-03-14 01:48:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 01:48:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 01:48:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4639 transitions. [2025-03-14 01:48:54,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903056258516644 [2025-03-14 01:48:54,195 INFO L175 Difference]: Start difference. First operand has 404 places, 441 transitions, 1318 flow. Second operand 11 states and 4639 transitions. [2025-03-14 01:48:54,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 511 transitions, 1900 flow [2025-03-14 01:48:54,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 511 transitions, 1892 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:48:54,231 INFO L231 Difference]: Finished difference. Result has 414 places, 462 transitions, 1635 flow [2025-03-14 01:48:54,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1635, PETRI_PLACES=414, PETRI_TRANSITIONS=462} [2025-03-14 01:48:54,232 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 23 predicate places. [2025-03-14 01:48:54,232 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 462 transitions, 1635 flow [2025-03-14 01:48:54,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:54,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:54,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:54,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:48:54,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:54,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1048235526, now seen corresponding path program 1 times [2025-03-14 01:48:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:54,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469730212] [2025-03-14 01:48:54,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:54,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:54,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-14 01:48:54,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-14 01:48:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:48:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469730212] [2025-03-14 01:48:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469730212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:54,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498987148] [2025-03-14 01:48:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:54,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:54,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:54,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 467 [2025-03-14 01:48:54,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 462 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:54,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:54,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 467 [2025-03-14 01:48:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:56,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][386], [Black: 513#(= |#race~data~0| 0), 66#L1042true, 459#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 146#L1066-3true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:56,113 INFO L294 olderBase$Statistics]: this new event has 316 ancestors and is cut-off event [2025-03-14 01:48:56,113 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-14 01:48:56,113 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-14 01:48:56,113 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2025-03-14 01:48:59,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][385], [Black: 513#(= |#race~data~0| 0), 459#true, 81#L1043-5true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 315#L1066-6true, 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:59,294 INFO L294 olderBase$Statistics]: this new event has 414 ancestors and is cut-off event [2025-03-14 01:48:59,294 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-03-14 01:48:59,294 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-03-14 01:48:59,294 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-03-14 01:48:59,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][385], [Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 81#L1043-5true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:59,305 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-03-14 01:48:59,305 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-14 01:48:59,305 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-14 01:48:59,305 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-14 01:48:59,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][385], [Black: 513#(= |#race~data~0| 0), 459#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 315#L1066-6true, 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 29#L1043-4true, Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:59,307 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-03-14 01:48:59,307 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-14 01:48:59,307 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-14 01:48:59,307 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-03-14 01:48:59,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][385], [Black: 513#(= |#race~data~0| 0), 459#true, 81#L1043-5true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, 525#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 295#L1066-4true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:59,316 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-03-14 01:48:59,316 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-03-14 01:48:59,316 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-14 01:48:59,316 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-03-14 01:48:59,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][385], [Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 29#L1043-4true, Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:59,317 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-03-14 01:48:59,317 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-03-14 01:48:59,317 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-03-14 01:48:59,317 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-14 01:48:59,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([942] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork1_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork1_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet8=|v_threadThread1of1ForFork1_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][385], [Black: 513#(= |#race~data~0| 0), 459#true, 488#(= |#race~flags~0| 0), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 574#true, Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 525#true, Black: 527#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 530#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 482#true, Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork0_#t~mem11| 0)), 29#L1043-4true, Black: 541#(= |cleanerThread1of1ForFork0_#t~mem11| 0), 535#true, Black: 486#true, 484#(= |#race~tids~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 492#(= |#race~threads_alive~0| 0), 295#L1066-4true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 309#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork0_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-03-14 01:48:59,327 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2025-03-14 01:48:59,327 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-14 01:48:59,327 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-03-14 01:48:59,327 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-03-14 01:48:59,389 INFO L124 PetriNetUnfolderBase]: 7381/33271 cut-off events. [2025-03-14 01:48:59,389 INFO L125 PetriNetUnfolderBase]: For 13778/16996 co-relation queries the response was YES. [2025-03-14 01:48:59,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61343 conditions, 33271 events. 7381/33271 cut-off events. For 13778/16996 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 408373 event pairs, 3596 based on Foata normal form. 95/30818 useless extension candidates. Maximal degree in co-relation 61166. Up to 7671 conditions per place. [2025-03-14 01:48:59,669 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 32 selfloop transitions, 5 changer transitions 0/475 dead transitions. [2025-03-14 01:48:59,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 475 transitions, 1737 flow [2025-03-14 01:48:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1330 transitions. [2025-03-14 01:48:59,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493219129193433 [2025-03-14 01:48:59,671 INFO L175 Difference]: Start difference. First operand has 414 places, 462 transitions, 1635 flow. Second operand 3 states and 1330 transitions. [2025-03-14 01:48:59,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 475 transitions, 1737 flow [2025-03-14 01:48:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 475 transitions, 1726 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:48:59,717 INFO L231 Difference]: Finished difference. Result has 412 places, 465 transitions, 1660 flow [2025-03-14 01:48:59,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1660, PETRI_PLACES=412, PETRI_TRANSITIONS=465} [2025-03-14 01:48:59,718 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 21 predicate places. [2025-03-14 01:48:59,718 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 465 transitions, 1660 flow [2025-03-14 01:48:59,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:59,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:59,718 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:59,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:48:59,718 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:48:59,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1253041618, now seen corresponding path program 1 times [2025-03-14 01:48:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:59,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164225672] [2025-03-14 01:48:59,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:59,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-14 01:48:59,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-14 01:48:59,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:59,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:49:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164225672] [2025-03-14 01:49:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164225672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:49:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140384536] [2025-03-14 01:49:00,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:00,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:49:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:00,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:49:00,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:49:01,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 467 [2025-03-14 01:49:01,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 465 transitions, 1660 flow. Second operand has 11 states, 11 states have (on average 403.72727272727275) internal successors, (4441), 11 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:01,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:01,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 467 [2025-03-14 01:49:01,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:49:09,779 INFO L124 PetriNetUnfolderBase]: 14357/53365 cut-off events. [2025-03-14 01:49:09,780 INFO L125 PetriNetUnfolderBase]: For 43891/48393 co-relation queries the response was YES. [2025-03-14 01:49:10,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113050 conditions, 53365 events. 14357/53365 cut-off events. For 43891/48393 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 660853 event pairs, 5450 based on Foata normal form. 828/50258 useless extension candidates. Maximal degree in co-relation 112869. Up to 10611 conditions per place. [2025-03-14 01:49:10,341 INFO L140 encePairwiseOnDemand]: 449/467 looper letters, 169 selfloop transitions, 57 changer transitions 0/578 dead transitions. [2025-03-14 01:49:10,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 578 transitions, 2657 flow [2025-03-14 01:49:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:49:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:49:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5374 transitions. [2025-03-14 01:49:10,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.885191895898534 [2025-03-14 01:49:10,348 INFO L175 Difference]: Start difference. First operand has 412 places, 465 transitions, 1660 flow. Second operand 13 states and 5374 transitions. [2025-03-14 01:49:10,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 578 transitions, 2657 flow [2025-03-14 01:49:10,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 578 transitions, 2647 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:49:10,504 INFO L231 Difference]: Finished difference. Result has 426 places, 490 transitions, 1997 flow [2025-03-14 01:49:10,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1997, PETRI_PLACES=426, PETRI_TRANSITIONS=490} [2025-03-14 01:49:10,505 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 35 predicate places. [2025-03-14 01:49:10,505 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 490 transitions, 1997 flow [2025-03-14 01:49:10,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 403.72727272727275) internal successors, (4441), 11 states have internal predecessors, (4441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:10,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:49:10,506 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:49:10,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:49:10,506 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-14 01:49:10,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:49:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1791626136, now seen corresponding path program 1 times [2025-03-14 01:49:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:49:10,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111484832] [2025-03-14 01:49:10,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:49:10,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:49:10,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-14 01:49:10,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-14 01:49:10,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:49:10,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:49:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:49:10,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:49:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111484832] [2025-03-14 01:49:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111484832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:49:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:49:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:49:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54693932] [2025-03-14 01:49:10,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:49:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:49:10,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:49:10,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:49:10,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:49:10,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2025-03-14 01:49:10,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 490 transitions, 1997 flow. Second operand has 3 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:49:10,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:49:10,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2025-03-14 01:49:10,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand