./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 05:42:47,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:42:47,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:42:47,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:42:47,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:42:47,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:42:47,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:42:47,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:42:47,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:42:47,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:42:47,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:42:47,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:42:47,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:42:47,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:42:47,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:42:47,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:42:47,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:42:47,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:42:47,428 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-jdk21/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-02-08 05:42:47,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:42:47,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:42:47,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:42:47,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:42:47,632 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:42:47,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2025-02-08 05:42:48,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be01711a/2a4bf2498d344b67874795c8c3b2f585/FLAG9aee88106 [2025-02-08 05:42:49,095 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:42:49,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter.i [2025-02-08 05:42:49,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be01711a/2a4bf2498d344b67874795c8c3b2f585/FLAG9aee88106 [2025-02-08 05:42:49,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be01711a/2a4bf2498d344b67874795c8c3b2f585 [2025-02-08 05:42:49,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:42:49,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:42:49,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:42:49,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:42:49,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:42:49,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f184995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49, skipping insertion in model container [2025-02-08 05:42:49,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:42:49,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:42:49,752 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:42:49,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:42:49,854 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:42:49,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49 WrapperNode [2025-02-08 05:42:49,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:42:49,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:42:49,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:42:49,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:42:49,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,894 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2025-02-08 05:42:49,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:42:49,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:42:49,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:42:49,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:42:49,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:42:49,929 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:42:49,929 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:42:49,929 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:42:49,930 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (1/1) ... [2025-02-08 05:42:49,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:42:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:42:49,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:42:49,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:42:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:42:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:42:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-02-08 05:42:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-02-08 05:42:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:42:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:42:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:42:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:42:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:42:49,983 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:42:50,095 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:42:50,096 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:42:50,444 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:42:50,444 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:42:50,479 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:42:50,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:42:50,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:42:50 BoogieIcfgContainer [2025-02-08 05:42:50,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:42:50,482 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:42:50,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:42:50,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:42:50,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:42:49" (1/3) ... [2025-02-08 05:42:50,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3445fb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:42:50, skipping insertion in model container [2025-02-08 05:42:50,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:49" (2/3) ... [2025-02-08 05:42:50,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3445fb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:42:50, skipping insertion in model container [2025-02-08 05:42:50,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:42:50" (3/3) ... [2025-02-08 05:42:50,487 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter.i [2025-02-08 05:42:50,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:42:50,499 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-02-08 05:42:50,499 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:42:50,580 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:42:50,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 467 transitions, 948 flow [2025-02-08 05:42:50,779 INFO L124 PetriNetUnfolderBase]: 19/586 cut-off events. [2025-02-08 05:42:50,781 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:42:50,789 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 966 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-02-08 05:42:50,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 467 transitions, 948 flow [2025-02-08 05:42:50,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 395 transitions, 800 flow [2025-02-08 05:42:50,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:42:50,809 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;@242db0c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:42:50,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 05:42:50,822 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:42:50,822 INFO L124 PetriNetUnfolderBase]: 0/148 cut-off events. [2025-02-08 05:42:50,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:42:50,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:50,822 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-02-08 05:42:50,822 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-02-08 05:42:50,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1500396678, now seen corresponding path program 1 times [2025-02-08 05:42:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441391615] [2025-02-08 05:42:50,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:42:50,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:42:50,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:50,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:51,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441391615] [2025-02-08 05:42:51,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441391615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:51,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:51,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:51,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134986599] [2025-02-08 05:42:51,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:51,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:51,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:51,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:51,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-02-08 05:42:51,272 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-02-08 05:42:51,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:51,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-02-08 05:42:51,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:51,981 INFO L124 PetriNetUnfolderBase]: 654/4276 cut-off events. [2025-02-08 05:42:51,982 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:42:51,999 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 67. Compared 33167 event pairs, 489 based on Foata normal form. 182/3766 useless extension candidates. Maximal degree in co-relation 5080. Up to 1006 conditions per place. [2025-02-08 05:42:52,019 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 28 selfloop transitions, 2 changer transitions 1/386 dead transitions. [2025-02-08 05:42:52,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 842 flow [2025-02-08 05:42:52,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-02-08 05:42:52,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-02-08 05:42:52,042 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 800 flow. Second operand 3 states and 1303 transitions. [2025-02-08 05:42:52,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 842 flow [2025-02-08 05:42:52,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:42:52,066 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 783 flow [2025-02-08 05:42:52,072 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-02-08 05:42:52,075 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -3 predicate places. [2025-02-08 05:42:52,075 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 783 flow [2025-02-08 05:42:52,076 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-02-08 05:42:52,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:52,076 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-02-08 05:42:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:42:52,076 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-02-08 05:42:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1173246974, now seen corresponding path program 1 times [2025-02-08 05:42:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:52,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254781390] [2025-02-08 05:42:52,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:52,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:42:52,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:42:52,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:52,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:52,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-02-08 05:42:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254781390] [2025-02-08 05:42:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254781390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35148328] [2025-02-08 05:42:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:52,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:52,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:52,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 467 [2025-02-08 05:42:52,274 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-02-08 05:42:52,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:52,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 467 [2025-02-08 05:42:52,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:52,964 INFO L124 PetriNetUnfolderBase]: 760/4471 cut-off events. [2025-02-08 05:42:52,964 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:42:52,986 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 34782 event pairs, 564 based on Foata normal form. 0/3827 useless extension candidates. Maximal degree in co-relation 5528. Up to 1180 conditions per place. [2025-02-08 05:42:53,013 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 31 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2025-02-08 05:42:53,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 833 flow [2025-02-08 05:42:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-02-08 05:42:53,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100642398286938 [2025-02-08 05:42:53,019 INFO L175 Difference]: Start difference. First operand has 388 places, 385 transitions, 783 flow. Second operand 3 states and 1275 transitions. [2025-02-08 05:42:53,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 833 flow [2025-02-08 05:42:53,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:53,027 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 767 flow [2025-02-08 05:42:53,028 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-02-08 05:42:53,032 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-02-08 05:42:53,032 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 767 flow [2025-02-08 05:42:53,033 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-02-08 05:42:53,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:53,033 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-02-08 05:42:53,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:42:53,033 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-02-08 05:42:53,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash -563403117, now seen corresponding path program 1 times [2025-02-08 05:42:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943288964] [2025-02-08 05:42:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:53,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:42:53,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:42:53,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:53,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:53,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:53,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943288964] [2025-02-08 05:42:53,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943288964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:53,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:53,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:53,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719914428] [2025-02-08 05:42:53,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:53,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:53,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:53,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:53,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:53,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 467 [2025-02-08 05:42:53,160 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-02-08 05:42:53,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:53,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 467 [2025-02-08 05:42:53,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:53,687 INFO L124 PetriNetUnfolderBase]: 725/4655 cut-off events. [2025-02-08 05:42:53,688 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:42:53,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 4655 events. 725/4655 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 37835 event pairs, 548 based on Foata normal form. 0/3948 useless extension candidates. Maximal degree in co-relation 5641. Up to 1111 conditions per place. [2025-02-08 05:42:53,718 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-02-08 05:42:53,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 817 flow [2025-02-08 05:42:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2025-02-08 05:42:53,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314775160599572 [2025-02-08 05:42:53,722 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 767 flow. Second operand 3 states and 1305 transitions. [2025-02-08 05:42:53,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 817 flow [2025-02-08 05:42:53,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:42:53,727 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2025-02-08 05:42:53,727 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-02-08 05:42:53,728 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-02-08 05:42:53,728 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2025-02-08 05:42:53,729 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-02-08 05:42:53,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:53,729 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-02-08 05:42:53,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:42:53,729 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-02-08 05:42:53,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -335121739, now seen corresponding path program 1 times [2025-02-08 05:42:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381942111] [2025-02-08 05:42:53,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:53,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-08 05:42:53,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-08 05:42:53,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:53,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:53,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381942111] [2025-02-08 05:42:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381942111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:53,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:53,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754537912] [2025-02-08 05:42:53,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:53,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:53,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:53,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:53,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-02-08 05:42:53,847 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-02-08 05:42:53,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:53,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-02-08 05:42:53,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:54,345 INFO L124 PetriNetUnfolderBase]: 849/4491 cut-off events. [2025-02-08 05:42:54,345 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:42:54,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 4491 events. 849/4491 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34709 event pairs, 607 based on Foata normal form. 0/3829 useless extension candidates. Maximal degree in co-relation 5641. Up to 1267 conditions per place. [2025-02-08 05:42:54,369 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-02-08 05:42:54,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 818 flow [2025-02-08 05:42:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-02-08 05:42:54,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2025-02-08 05:42:54,372 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1302 transitions. [2025-02-08 05:42:54,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 818 flow [2025-02-08 05:42:54,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:54,376 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2025-02-08 05:42:54,376 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-02-08 05:42:54,377 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -12 predicate places. [2025-02-08 05:42:54,377 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2025-02-08 05:42:54,378 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-02-08 05:42:54,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:54,378 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-02-08 05:42:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:42:54,378 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-02-08 05:42:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash 26762455, now seen corresponding path program 1 times [2025-02-08 05:42:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243000230] [2025-02-08 05:42:54,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:54,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:42:54,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:42:54,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:54,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:54,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:54,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243000230] [2025-02-08 05:42:54,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243000230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:54,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:54,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:54,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287024509] [2025-02-08 05:42:54,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:54,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:54,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:54,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:54,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2025-02-08 05:42:54,491 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-02-08 05:42:54,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:54,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2025-02-08 05:42:54,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:54,890 INFO L124 PetriNetUnfolderBase]: 991/4610 cut-off events. [2025-02-08 05:42:54,891 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:42:54,902 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 36047 event pairs, 713 based on Foata normal form. 0/3945 useless extension candidates. Maximal degree in co-relation 5970. Up to 1475 conditions per place. [2025-02-08 05:42:54,963 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-02-08 05:42:54,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 820 flow [2025-02-08 05:42:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-02-08 05:42:54,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-02-08 05:42:54,966 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1298 transitions. [2025-02-08 05:42:54,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 820 flow [2025-02-08 05:42:54,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:54,971 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2025-02-08 05:42:54,972 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-02-08 05:42:54,973 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-02-08 05:42:54,973 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2025-02-08 05:42:54,974 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-02-08 05:42:54,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:54,974 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-02-08 05:42:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:42:54,975 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-02-08 05:42:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1353496265, now seen corresponding path program 1 times [2025-02-08 05:42:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885189317] [2025-02-08 05:42:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:54,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-08 05:42:55,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-08 05:42:55,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:55,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:55,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:55,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885189317] [2025-02-08 05:42:55,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885189317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:55,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:55,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:55,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116954494] [2025-02-08 05:42:55,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:55,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:55,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:55,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:55,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:55,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 467 [2025-02-08 05:42:55,077 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-02-08 05:42:55,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:55,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 467 [2025-02-08 05:42:55,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:55,614 INFO L124 PetriNetUnfolderBase]: 1451/5118 cut-off events. [2025-02-08 05:42:55,614 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 05:42:55,626 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 112. Compared 38930 event pairs, 507 based on Foata normal form. 0/4535 useless extension candidates. Maximal degree in co-relation 7156. Up to 2100 conditions per place. [2025-02-08 05:42:55,638 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 38 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-02-08 05:42:55,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 383 transitions, 867 flow [2025-02-08 05:42:55,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-02-08 05:42:55,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214846538187009 [2025-02-08 05:42:55,642 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1291 transitions. [2025-02-08 05:42:55,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 383 transitions, 867 flow [2025-02-08 05:42:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:55,647 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 771 flow [2025-02-08 05:42:55,647 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-02-08 05:42:55,649 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-02-08 05:42:55,650 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 771 flow [2025-02-08 05:42:55,651 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-02-08 05:42:55,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:55,651 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-02-08 05:42:55,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:42:55,651 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-02-08 05:42:55,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2110809348, now seen corresponding path program 1 times [2025-02-08 05:42:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993224632] [2025-02-08 05:42:55,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:55,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:42:55,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:42:55,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:55,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:55,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:55,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993224632] [2025-02-08 05:42:55,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993224632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:55,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:55,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:55,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387411976] [2025-02-08 05:42:55,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:55,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:55,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:55,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:55,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:55,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2025-02-08 05:42:55,751 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-02-08 05:42:55,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:55,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2025-02-08 05:42:55,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:56,388 INFO L124 PetriNetUnfolderBase]: 971/5688 cut-off events. [2025-02-08 05:42:56,389 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-08 05:42:56,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7384 conditions, 5688 events. 971/5688 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 49128 event pairs, 625 based on Foata normal form. 0/5056 useless extension candidates. Maximal degree in co-relation 7228. Up to 1488 conditions per place. [2025-02-08 05:42:56,421 INFO L140 encePairwiseOnDemand]: 461/467 looper letters, 30 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2025-02-08 05:42:56,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 379 transitions, 849 flow [2025-02-08 05:42:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-02-08 05:42:56,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9336188436830836 [2025-02-08 05:42:56,425 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 771 flow. Second operand 3 states and 1308 transitions. [2025-02-08 05:42:56,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 379 transitions, 849 flow [2025-02-08 05:42:56,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:42:56,430 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 786 flow [2025-02-08 05:42:56,430 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-02-08 05:42:56,431 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-02-08 05:42:56,431 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 786 flow [2025-02-08 05:42:56,432 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-02-08 05:42:56,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:56,433 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-02-08 05:42:56,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:42:56,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:42:56,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1145667236, now seen corresponding path program 1 times [2025-02-08 05:42:56,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:56,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920469922] [2025-02-08 05:42:56,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:56,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-08 05:42:56,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-08 05:42:56,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:56,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:56,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:56,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920469922] [2025-02-08 05:42:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920469922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305900898] [2025-02-08 05:42:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:56,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:56,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:56,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:56,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-02-08 05:42:56,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 786 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-02-08 05:42:56,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:56,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-02-08 05:42:56,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:57,344 INFO L124 PetriNetUnfolderBase]: 1749/8110 cut-off events. [2025-02-08 05:42:57,344 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 05:42:57,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11188 conditions, 8110 events. 1749/8110 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 71552 event pairs, 642 based on Foata normal form. 0/7065 useless extension candidates. Maximal degree in co-relation 11031. Up to 1448 conditions per place. [2025-02-08 05:42:57,389 INFO L140 encePairwiseOnDemand]: 456/467 looper letters, 44 selfloop transitions, 8 changer transitions 0/397 dead transitions. [2025-02-08 05:42:57,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 397 transitions, 944 flow [2025-02-08 05:42:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-02-08 05:42:57,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-02-08 05:42:57,392 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 786 flow. Second operand 3 states and 1321 transitions. [2025-02-08 05:42:57,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 397 transitions, 944 flow [2025-02-08 05:42:57,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 397 transitions, 944 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:42:57,396 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 856 flow [2025-02-08 05:42:57,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-02-08 05:42:57,397 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-02-08 05:42:57,397 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 856 flow [2025-02-08 05:42:57,398 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-02-08 05:42:57,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:57,398 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-02-08 05:42:57,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:42:57,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-02-08 05:42:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1014929426, now seen corresponding path program 1 times [2025-02-08 05:42:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846664288] [2025-02-08 05:42:57,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:57,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-08 05:42:57,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-08 05:42:57,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:57,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846664288] [2025-02-08 05:42:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846664288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:57,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:57,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:57,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941508141] [2025-02-08 05:42:57,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:57,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:57,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:57,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:57,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2025-02-08 05:42:57,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 856 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-02-08 05:42:57,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:57,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2025-02-08 05:42:57,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:58,532 INFO L124 PetriNetUnfolderBase]: 2120/10630 cut-off events. [2025-02-08 05:42:58,532 INFO L125 PetriNetUnfolderBase]: For 155/163 co-relation queries the response was YES. [2025-02-08 05:42:58,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 10630 events. 2120/10630 cut-off events. For 155/163 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 101039 event pairs, 1244 based on Foata normal form. 0/9537 useless extension candidates. Maximal degree in co-relation 14294. Up to 2843 conditions per place. [2025-02-08 05:42:58,585 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 35 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-02-08 05:42:58,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 953 flow [2025-02-08 05:42:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-02-08 05:42:58,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-02-08 05:42:58,588 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 856 flow. Second operand 3 states and 1303 transitions. [2025-02-08 05:42:58,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 953 flow [2025-02-08 05:42:58,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 937 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:58,593 INFO L231 Difference]: Finished difference. Result has 376 places, 380 transitions, 848 flow [2025-02-08 05:42:58,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=376, PETRI_TRANSITIONS=380} [2025-02-08 05:42:58,594 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -15 predicate places. [2025-02-08 05:42:58,594 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 380 transitions, 848 flow [2025-02-08 05:42:58,595 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-02-08 05:42:58,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:58,595 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-02-08 05:42:58,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:42:58,596 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-02-08 05:42:58,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash -806405679, now seen corresponding path program 1 times [2025-02-08 05:42:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:58,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265618833] [2025-02-08 05:42:58,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:58,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:58,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 05:42:58,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 05:42:58,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:58,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:58,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:58,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265618833] [2025-02-08 05:42:58,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265618833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:58,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:58,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:58,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309041745] [2025-02-08 05:42:58,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:58,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:58,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:58,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:58,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:58,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-02-08 05:42:58,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 380 transitions, 848 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-02-08 05:42:58,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:58,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-02-08 05:42:58,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:01,089 INFO L124 PetriNetUnfolderBase]: 4584/20498 cut-off events. [2025-02-08 05:43:01,089 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-02-08 05:43:01,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29224 conditions, 20498 events. 4584/20498 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 220439 event pairs, 2480 based on Foata normal form. 0/18579 useless extension candidates. Maximal degree in co-relation 29064. Up to 5342 conditions per place. [2025-02-08 05:43:01,227 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 45 selfloop transitions, 9 changer transitions 0/403 dead transitions. [2025-02-08 05:43:01,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 403 transitions, 1008 flow [2025-02-08 05:43:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-02-08 05:43:01,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-02-08 05:43:01,230 INFO L175 Difference]: Start difference. First operand has 376 places, 380 transitions, 848 flow. Second operand 3 states and 1321 transitions. [2025-02-08 05:43:01,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 403 transitions, 1008 flow [2025-02-08 05:43:01,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 403 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:01,238 INFO L231 Difference]: Finished difference. Result has 380 places, 388 transitions, 918 flow [2025-02-08 05:43:01,238 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-02-08 05:43:01,239 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-02-08 05:43:01,239 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 388 transitions, 918 flow [2025-02-08 05:43:01,240 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-02-08 05:43:01,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:01,240 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-02-08 05:43:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:43:01,240 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-02-08 05:43:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1766571074, now seen corresponding path program 1 times [2025-02-08 05:43:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676737390] [2025-02-08 05:43:01,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:01,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-08 05:43:01,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-08 05:43:01,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:01,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676737390] [2025-02-08 05:43:01,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676737390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:01,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328393150] [2025-02-08 05:43:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:01,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:01,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:01,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-02-08 05:43:01,497 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-02-08 05:43:01,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:01,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-02-08 05:43:01,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:03,399 INFO L124 PetriNetUnfolderBase]: 2608/15740 cut-off events. [2025-02-08 05:43:03,399 INFO L125 PetriNetUnfolderBase]: For 534/598 co-relation queries the response was YES. [2025-02-08 05:43:03,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22205 conditions, 15740 events. 2608/15740 cut-off events. For 534/598 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 172106 event pairs, 1917 based on Foata normal form. 4/14288 useless extension candidates. Maximal degree in co-relation 22041. Up to 3513 conditions per place. [2025-02-08 05:43:03,512 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 36 selfloop transitions, 8 changer transitions 0/402 dead transitions. [2025-02-08 05:43:03,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 402 transitions, 1033 flow [2025-02-08 05:43:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:03,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2595 transitions. [2025-02-08 05:43:03,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261241970021413 [2025-02-08 05:43:03,515 INFO L175 Difference]: Start difference. First operand has 380 places, 388 transitions, 918 flow. Second operand 6 states and 2595 transitions. [2025-02-08 05:43:03,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 402 transitions, 1033 flow [2025-02-08 05:43:03,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 402 transitions, 1015 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:03,527 INFO L231 Difference]: Finished difference. Result has 387 places, 392 transitions, 945 flow [2025-02-08 05:43:03,527 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-02-08 05:43:03,528 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -4 predicate places. [2025-02-08 05:43:03,528 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 392 transitions, 945 flow [2025-02-08 05:43:03,529 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-02-08 05:43:03,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:03,529 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-02-08 05:43:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:43:03,529 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-02-08 05:43:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -787910316, now seen corresponding path program 1 times [2025-02-08 05:43:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605848898] [2025-02-08 05:43:03,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:03,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-08 05:43:03,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-08 05:43:03,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:03,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605848898] [2025-02-08 05:43:03,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605848898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:03,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:03,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576209020] [2025-02-08 05:43:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:03,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:03,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:03,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:03,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 433 out of 467 [2025-02-08 05:43:03,613 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-02-08 05:43:03,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:03,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 433 of 467 [2025-02-08 05:43:03,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:05,666 INFO L124 PetriNetUnfolderBase]: 3169/16434 cut-off events. [2025-02-08 05:43:05,666 INFO L125 PetriNetUnfolderBase]: For 256/287 co-relation queries the response was YES. [2025-02-08 05:43:05,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23524 conditions, 16434 events. 3169/16434 cut-off events. For 256/287 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 176510 event pairs, 1835 based on Foata normal form. 2/14663 useless extension candidates. Maximal degree in co-relation 23356. Up to 3415 conditions per place. [2025-02-08 05:43:05,764 INFO L140 encePairwiseOnDemand]: 463/467 looper letters, 29 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2025-02-08 05:43:05,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 403 transitions, 1034 flow [2025-02-08 05:43:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1332 transitions. [2025-02-08 05:43:05,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507494646680942 [2025-02-08 05:43:05,767 INFO L175 Difference]: Start difference. First operand has 387 places, 392 transitions, 945 flow. Second operand 3 states and 1332 transitions. [2025-02-08 05:43:05,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 403 transitions, 1034 flow [2025-02-08 05:43:05,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 403 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:43:05,772 INFO L231 Difference]: Finished difference. Result has 390 places, 394 transitions, 963 flow [2025-02-08 05:43:05,773 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-02-08 05:43:05,773 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -1 predicate places. [2025-02-08 05:43:05,773 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 394 transitions, 963 flow [2025-02-08 05:43:05,774 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-02-08 05:43:05,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:05,774 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-02-08 05:43:05,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:43:05,774 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-02-08 05:43:05,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2109158683, now seen corresponding path program 1 times [2025-02-08 05:43:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103755125] [2025-02-08 05:43:05,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:05,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-08 05:43:05,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-08 05:43:05,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:05,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:43:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103755125] [2025-02-08 05:43:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103755125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:05,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092558526] [2025-02-08 05:43:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:05,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:43:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:05,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:43:05,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:43:05,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-02-08 05:43:05,965 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-02-08 05:43:05,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:05,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-02-08 05:43:05,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:08,863 INFO L124 PetriNetUnfolderBase]: 3868/20104 cut-off events. [2025-02-08 05:43:08,864 INFO L125 PetriNetUnfolderBase]: For 761/793 co-relation queries the response was YES. [2025-02-08 05:43:08,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29513 conditions, 20104 events. 3868/20104 cut-off events. For 761/793 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 223556 event pairs, 2588 based on Foata normal form. 6/18326 useless extension candidates. Maximal degree in co-relation 29342. Up to 5217 conditions per place. [2025-02-08 05:43:08,991 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 27 selfloop transitions, 4 changer transitions 17/406 dead transitions. [2025-02-08 05:43:08,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 406 transitions, 1078 flow [2025-02-08 05:43:08,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2596 transitions. [2025-02-08 05:43:08,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-02-08 05:43:08,994 INFO L175 Difference]: Start difference. First operand has 390 places, 394 transitions, 963 flow. Second operand 6 states and 2596 transitions. [2025-02-08 05:43:08,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 406 transitions, 1078 flow [2025-02-08 05:43:09,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 406 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:09,004 INFO L231 Difference]: Finished difference. Result has 395 places, 389 transitions, 944 flow [2025-02-08 05:43:09,005 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-02-08 05:43:09,005 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 4 predicate places. [2025-02-08 05:43:09,005 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 389 transitions, 944 flow [2025-02-08 05:43:09,006 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-02-08 05:43:09,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:09,006 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-02-08 05:43:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:43:09,007 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-02-08 05:43:09,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2055923357, now seen corresponding path program 1 times [2025-02-08 05:43:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820721449] [2025-02-08 05:43:09,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:09,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:43:09,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:43:09,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:09,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820721449] [2025-02-08 05:43:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820721449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:09,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903263823] [2025-02-08 05:43:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:09,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:09,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:09,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 467 [2025-02-08 05:43:09,735 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-02-08 05:43:09,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:09,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 467 [2025-02-08 05:43:09,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:14,338 INFO L124 PetriNetUnfolderBase]: 8722/33526 cut-off events. [2025-02-08 05:43:14,339 INFO L125 PetriNetUnfolderBase]: For 2605/3103 co-relation queries the response was YES. [2025-02-08 05:43:14,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54285 conditions, 33526 events. 8722/33526 cut-off events. For 2605/3103 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 386820 event pairs, 4896 based on Foata normal form. 3/29989 useless extension candidates. Maximal degree in co-relation 54110. Up to 11090 conditions per place. [2025-02-08 05:43:14,592 INFO L140 encePairwiseOnDemand]: 453/467 looper letters, 95 selfloop transitions, 46 changer transitions 0/485 dead transitions. [2025-02-08 05:43:14,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 485 transitions, 1500 flow [2025-02-08 05:43:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2579 transitions. [2025-02-08 05:43:14,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9204139900071378 [2025-02-08 05:43:14,595 INFO L175 Difference]: Start difference. First operand has 395 places, 389 transitions, 944 flow. Second operand 6 states and 2579 transitions. [2025-02-08 05:43:14,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 485 transitions, 1500 flow [2025-02-08 05:43:14,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 485 transitions, 1472 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-02-08 05:43:14,608 INFO L231 Difference]: Finished difference. Result has 391 places, 434 transitions, 1251 flow [2025-02-08 05:43:14,608 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-02-08 05:43:14,609 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 0 predicate places. [2025-02-08 05:43:14,609 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 434 transitions, 1251 flow [2025-02-08 05:43:14,610 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-02-08 05:43:14,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:14,610 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-02-08 05:43:14,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:43:14,610 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-02-08 05:43:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 905952864, now seen corresponding path program 1 times [2025-02-08 05:43:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395522522] [2025-02-08 05:43:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:14,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-08 05:43:14,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-08 05:43:14,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:14,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:14,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:14,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395522522] [2025-02-08 05:43:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395522522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:14,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353147612] [2025-02-08 05:43:14,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:14,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:43:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:14,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:43:14,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:43:15,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 467 [2025-02-08 05:43:15,050 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-02-08 05:43:15,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:15,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 467 [2025-02-08 05:43:15,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:20,541 INFO L124 PetriNetUnfolderBase]: 9762/40857 cut-off events. [2025-02-08 05:43:20,542 INFO L125 PetriNetUnfolderBase]: For 3921/6025 co-relation queries the response was YES. [2025-02-08 05:43:20,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67884 conditions, 40857 events. 9762/40857 cut-off events. For 3921/6025 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 502192 event pairs, 4609 based on Foata normal form. 257/36998 useless extension candidates. Maximal degree in co-relation 67715. Up to 10941 conditions per place. [2025-02-08 05:43:20,935 INFO L140 encePairwiseOnDemand]: 455/467 looper letters, 64 selfloop transitions, 14 changer transitions 10/483 dead transitions. [2025-02-08 05:43:20,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 483 transitions, 1530 flow [2025-02-08 05:43:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:43:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:43:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4268 transitions. [2025-02-08 05:43:20,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139186295503212 [2025-02-08 05:43:20,940 INFO L175 Difference]: Start difference. First operand has 391 places, 434 transitions, 1251 flow. Second operand 10 states and 4268 transitions. [2025-02-08 05:43:20,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 483 transitions, 1530 flow [2025-02-08 05:43:20,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 483 transitions, 1530 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:20,953 INFO L231 Difference]: Finished difference. Result has 404 places, 441 transitions, 1318 flow [2025-02-08 05:43:20,953 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-02-08 05:43:20,954 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 13 predicate places. [2025-02-08 05:43:20,954 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 441 transitions, 1318 flow [2025-02-08 05:43:20,955 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-02-08 05:43:20,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:20,955 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-02-08 05:43:20,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:43:20,955 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-02-08 05:43:20,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2086647640, now seen corresponding path program 1 times [2025-02-08 05:43:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381479640] [2025-02-08 05:43:20,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:20,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-08 05:43:20,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-08 05:43:20,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:20,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381479640] [2025-02-08 05:43:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381479640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241277052] [2025-02-08 05:43:21,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:21,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:43:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:21,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:43:21,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:43:21,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2025-02-08 05:43:21,575 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-02-08 05:43:21,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:21,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2025-02-08 05:43:21,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:28,060 INFO L124 PetriNetUnfolderBase]: 11533/46373 cut-off events. [2025-02-08 05:43:28,061 INFO L125 PetriNetUnfolderBase]: For 16052/17683 co-relation queries the response was YES. [2025-02-08 05:43:28,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86601 conditions, 46373 events. 11533/46373 cut-off events. For 16052/17683 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 569591 event pairs, 4000 based on Foata normal form. 118/42711 useless extension candidates. Maximal degree in co-relation 86426. Up to 8375 conditions per place. [2025-02-08 05:43:28,474 INFO L140 encePairwiseOnDemand]: 454/467 looper letters, 101 selfloop transitions, 44 changer transitions 0/511 dead transitions. [2025-02-08 05:43:28,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 511 transitions, 1900 flow [2025-02-08 05:43:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:43:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:43:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4639 transitions. [2025-02-08 05:43:28,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.903056258516644 [2025-02-08 05:43:28,479 INFO L175 Difference]: Start difference. First operand has 404 places, 441 transitions, 1318 flow. Second operand 11 states and 4639 transitions. [2025-02-08 05:43:28,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 511 transitions, 1900 flow [2025-02-08 05:43:28,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 511 transitions, 1892 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:43:28,508 INFO L231 Difference]: Finished difference. Result has 414 places, 462 transitions, 1635 flow [2025-02-08 05:43:28,508 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-02-08 05:43:28,508 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 23 predicate places. [2025-02-08 05:43:28,509 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 462 transitions, 1635 flow [2025-02-08 05:43:28,510 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-02-08 05:43:28,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:28,510 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-02-08 05:43:28,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:43:28,510 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-02-08 05:43:28,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:28,511 INFO L85 PathProgramCache]: Analyzing trace with hash -342510365, now seen corresponding path program 1 times [2025-02-08 05:43:28,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:28,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934035994] [2025-02-08 05:43:28,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:28,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-08 05:43:28,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-08 05:43:28,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:28,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:28,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:28,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934035994] [2025-02-08 05:43:28,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934035994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:28,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056509569] [2025-02-08 05:43:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:28,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:28,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:28,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 467 [2025-02-08 05:43:28,574 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-02-08 05:43:28,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:28,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 467 [2025-02-08 05:43:28,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:30,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][361], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 145#L1066-3true, 459#true, 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, 248#L1040-2true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~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)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,330 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is not cut-off event [2025-02-08 05:43:30,331 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-02-08 05:43:30,331 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-02-08 05:43:30,331 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-02-08 05:43:30,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, 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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~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)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 316#L1066-6true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,493 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-02-08 05:43:30,494 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:30,494 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:30,494 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:30,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,509 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-08 05:43:30,509 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,509 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,509 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, 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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~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)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 316#L1066-6true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,509 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-08 05:43:30,509 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,509 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,510 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,724 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, 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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 316#L1066-6true, 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,724 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-02-08 05:43:30,724 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:30,724 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-02-08 05:43:30,724 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:30,724 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:30,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 300#L1066-4true, 459#true, 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|)), 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|)), 574#true, 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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,725 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-08 05:43:30,725 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,725 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,725 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,726 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-08 05:43:30,726 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,726 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,726 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,740 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,740 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-08 05:43:30,740 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,740 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,740 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,740 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-08 05:43:30,741 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, 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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 316#L1066-6true, 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,741 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-08 05:43:30,741 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,741 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,741 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-08 05:43:30,741 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:30,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 300#L1066-4true, 459#true, 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|)), 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|)), 574#true, 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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,742 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-02-08 05:43:30,742 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:30,742 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:30,742 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:30,757 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 300#L1066-4true, 459#true, 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|)), 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, 574#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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,758 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,758 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,758 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:30,774 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 300#L1066-4true, 459#true, 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|)), 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, 574#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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 535#true, 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:30,775 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-02-08 05:43:30,775 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:30,775 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:30,775 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-02-08 05:43:30,775 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:33,501 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, 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|)), 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, 574#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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, 316#L1066-6true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:33,502 INFO L294 olderBase$Statistics]: this new event has 414 ancestors and is cut-off event [2025-02-08 05:43:33,502 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-02-08 05:43:33,502 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:33,502 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-02-08 05:43:33,502 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:33,502 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-08 05:43:33,513 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 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|)), 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, 574#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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:33,513 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-02-08 05:43:33,513 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:33,513 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:33,513 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:33,513 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-08 05:43:33,514 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-08 05:43:33,515 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 459#true, 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|)), 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|)), 574#true, 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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, 316#L1066-6true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:33,515 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-02-08 05:43:33,515 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:33,515 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-08 05:43:33,515 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:33,515 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-08 05:43:33,515 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-08 05:43:33,525 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 300#L1066-4true, 459#true, 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|)), 574#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), 326#L1043-5true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:33,525 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-02-08 05:43:33,525 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:43:33,525 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:33,525 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:33,525 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 131#L1066-5true, 459#true, 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|)), 574#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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:33,526 INFO L294 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:33,526 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-08 05:43:33,537 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([941] L1034-2-->L1034: Formula: (= (store |v_#race_32| v_~flags~0.base_13 (store (select |v_#race_32| v_~flags~0.base_13) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_13) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_31|) InVars {#race=|v_#race_32|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} OutVars{#race=|v_#race_31|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_13, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_13} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 513#(= |#race~data~0| 0), 300#L1066-4true, 459#true, 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|)), 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, 574#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), 393#L1043-4true, Black: 478#true, Black: 540#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 539#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 482#true, Black: 547#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 535#true, Black: 541#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 484#(= |#race~tids~0| 0), Black: 488#(= |#race~threads_alive~0| 0), 567#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 491#true, 461#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 347#L1034true, Black: 569#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 558#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 557#(not (= ~flags~0.base ~tids~0.base)), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0)]) [2025-02-08 05:43:33,537 INFO L294 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2025-02-08 05:43:33,537 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:33,537 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:33,537 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-02-08 05:43:33,537 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-02-08 05:43:33,537 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:33,603 INFO L124 PetriNetUnfolderBase]: 7494/33799 cut-off events. [2025-02-08 05:43:33,603 INFO L125 PetriNetUnfolderBase]: For 14096/16700 co-relation queries the response was YES. [2025-02-08 05:43:33,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62293 conditions, 33799 events. 7494/33799 cut-off events. For 14096/16700 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 417213 event pairs, 3643 based on Foata normal form. 107/31321 useless extension candidates. Maximal degree in co-relation 62116. Up to 7812 conditions per place. [2025-02-08 05:43:33,850 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 32 selfloop transitions, 5 changer transitions 0/475 dead transitions. [2025-02-08 05:43:33,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 475 transitions, 1737 flow [2025-02-08 05:43:33,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1330 transitions. [2025-02-08 05:43:33,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9493219129193433 [2025-02-08 05:43:33,852 INFO L175 Difference]: Start difference. First operand has 414 places, 462 transitions, 1635 flow. Second operand 3 states and 1330 transitions. [2025-02-08 05:43:33,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 475 transitions, 1737 flow [2025-02-08 05:43:33,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 475 transitions, 1726 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:43:33,897 INFO L231 Difference]: Finished difference. Result has 412 places, 465 transitions, 1660 flow [2025-02-08 05:43:33,898 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-02-08 05:43:33,898 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 21 predicate places. [2025-02-08 05:43:33,898 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 465 transitions, 1660 flow [2025-02-08 05:43:33,898 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-02-08 05:43:33,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:33,899 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-02-08 05:43:33,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:43:33,899 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-02-08 05:43:33,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:33,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1410939255, now seen corresponding path program 1 times [2025-02-08 05:43:33,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:33,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288599723] [2025-02-08 05:43:33,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:33,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:33,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-08 05:43:33,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-08 05:43:33,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:33,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:34,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-02-08 05:43:34,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:34,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288599723] [2025-02-08 05:43:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288599723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:43:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356624659] [2025-02-08 05:43:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:43:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:34,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:43:34,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:43:35,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 467 [2025-02-08 05:43:35,116 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-02-08 05:43:35,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:35,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 467 [2025-02-08 05:43:35,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand