./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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-race-3.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 21bb8f266262880d0d6873fb2e4e8bc5cd60f79baa0774ffc8a8aedd31b66692 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:34:29,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:34:29,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:34:29,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:34:29,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:34:29,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:34:29,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:34:29,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:34:29,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:34:29,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:34:29,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:34:29,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:34:29,498 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:34:29,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:34:29,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:34:29,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:34:29,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:34:29,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:34:29,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:34:29,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:34:29,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:34:29,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:34:29,501 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 -> 21bb8f266262880d0d6873fb2e4e8bc5cd60f79baa0774ffc8a8aedd31b66692 [2025-02-06 09:34:29,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:34:29,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:34:29,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:34:29,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:34:29,710 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:34:29,712 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-race-3.i [2025-02-06 09:34:30,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8bfd5ada/bfbfee02ae0d45d799428688eaf21ede/FLAG9139ac742 [2025-02-06 09:34:31,157 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:34:31,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-3.i [2025-02-06 09:34:31,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8bfd5ada/bfbfee02ae0d45d799428688eaf21ede/FLAG9139ac742 [2025-02-06 09:34:31,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a8bfd5ada/bfbfee02ae0d45d799428688eaf21ede [2025-02-06 09:34:31,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:34:31,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:34:31,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:34:31,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:34:31,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:34:31,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5381d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31, skipping insertion in model container [2025-02-06 09:34:31,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:34:31,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:34:31,740 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:34:31,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:34:31,833 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:34:31,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31 WrapperNode [2025-02-06 09:34:31,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:34:31,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:34:31,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:34:31,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:34:31,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,864 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2025-02-06 09:34:31,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:34:31,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:34:31,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:34:31,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:34:31,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:34:31,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:34:31,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:34:31,900 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:34:31,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (1/1) ... [2025-02-06 09:34:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:34:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:34:31,923 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-06 09:34:31,925 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-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-02-06 09:34:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:34:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:34:31,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:34:31,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:34:31,942 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:34:32,042 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:34:32,044 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:34:32,441 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:34:32,442 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:34:32,472 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:34:32,472 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:34:32,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:34:32 BoogieIcfgContainer [2025-02-06 09:34:32,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:34:32,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:34:32,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:34:32,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:34:32,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:34:31" (1/3) ... [2025-02-06 09:34:32,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75347e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:34:32, skipping insertion in model container [2025-02-06 09:34:32,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:31" (2/3) ... [2025-02-06 09:34:32,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75347e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:34:32, skipping insertion in model container [2025-02-06 09:34:32,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:34:32" (3/3) ... [2025-02-06 09:34:32,497 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-3.i [2025-02-06 09:34:32,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:34:32,511 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter-race-3.i that has 3 procedures, 384 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2025-02-06 09:34:32,511 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:34:32,588 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:34:32,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 456 places, 463 transitions, 940 flow [2025-02-06 09:34:32,787 INFO L124 PetriNetUnfolderBase]: 19/584 cut-off events. [2025-02-06 09:34:32,790 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:34:32,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 584 events. 19/584 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 955 event pairs, 0 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 372. Up to 6 conditions per place. [2025-02-06 09:34:32,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 456 places, 463 transitions, 940 flow [2025-02-06 09:34:32,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 389 places, 393 transitions, 796 flow [2025-02-06 09:34:32,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:34:32,839 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;@7edf5546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:34:32,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-06 09:34:32,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:34:32,852 INFO L124 PetriNetUnfolderBase]: 0/148 cut-off events. [2025-02-06 09:34:32,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:34:32,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:32,853 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-06 09:34:32,853 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-06 09:34:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1089007381, now seen corresponding path program 1 times [2025-02-06 09:34:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177956520] [2025-02-06 09:34:32,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:32,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:32,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-06 09:34:32,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-06 09:34:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:33,176 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-06 09:34:33,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:33,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177956520] [2025-02-06 09:34:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177956520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413895283] [2025-02-06 09:34:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:33,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:33,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:33,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2025-02-06 09:34:33,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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-06 09:34:33,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:33,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2025-02-06 09:34:33,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:34,162 INFO L124 PetriNetUnfolderBase]: 654/4258 cut-off events. [2025-02-06 09:34:34,162 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 09:34:34,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 4258 events. 654/4258 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 32905 event pairs, 489 based on Foata normal form. 182/3744 useless extension candidates. Maximal degree in co-relation 5062. Up to 1006 conditions per place. [2025-02-06 09:34:34,196 INFO L140 encePairwiseOnDemand]: 454/463 looper letters, 28 selfloop transitions, 2 changer transitions 1/384 dead transitions. [2025-02-06 09:34:34,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 384 transitions, 838 flow [2025-02-06 09:34:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-02-06 09:34:34,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294456443484521 [2025-02-06 09:34:34,216 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 796 flow. Second operand 3 states and 1291 transitions. [2025-02-06 09:34:34,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 384 transitions, 838 flow [2025-02-06 09:34:34,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 384 transitions, 837 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:34:34,232 INFO L231 Difference]: Finished difference. Result has 386 places, 383 transitions, 779 flow [2025-02-06 09:34:34,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=386, PETRI_TRANSITIONS=383} [2025-02-06 09:34:34,237 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -3 predicate places. [2025-02-06 09:34:34,237 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 383 transitions, 779 flow [2025-02-06 09:34:34,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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-06 09:34:34,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:34,238 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-06 09:34:34,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:34:34,238 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-06 09:34:34,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:34,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1263285193, now seen corresponding path program 1 times [2025-02-06 09:34:34,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950642890] [2025-02-06 09:34:34,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 09:34:34,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 09:34:34,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:34,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950642890] [2025-02-06 09:34:34,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950642890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291481891] [2025-02-06 09:34:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:34,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:34,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:34,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:34,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 463 [2025-02-06 09:34:34,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 383 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 409.0) internal successors, (1227), 3 states have internal predecessors, (1227), 0 states have call successors, (0), 0 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-06 09:34:34,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:34,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 463 [2025-02-06 09:34:34,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:34,960 INFO L124 PetriNetUnfolderBase]: 760/4455 cut-off events. [2025-02-06 09:34:34,960 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 09:34:34,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5669 conditions, 4455 events. 760/4455 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 34763 event pairs, 564 based on Foata normal form. 0/3803 useless extension candidates. Maximal degree in co-relation 5512. Up to 1180 conditions per place. [2025-02-06 09:34:34,982 INFO L140 encePairwiseOnDemand]: 455/463 looper letters, 31 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2025-02-06 09:34:34,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 376 transitions, 829 flow [2025-02-06 09:34:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1263 transitions. [2025-02-06 09:34:34,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9092872570194385 [2025-02-06 09:34:34,987 INFO L175 Difference]: Start difference. First operand has 386 places, 383 transitions, 779 flow. Second operand 3 states and 1263 transitions. [2025-02-06 09:34:34,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 376 transitions, 829 flow [2025-02-06 09:34:34,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 376 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:34,993 INFO L231 Difference]: Finished difference. Result has 378 places, 376 transitions, 763 flow [2025-02-06 09:34:34,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=378, PETRI_TRANSITIONS=376} [2025-02-06 09:34:34,994 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -11 predicate places. [2025-02-06 09:34:34,994 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 376 transitions, 763 flow [2025-02-06 09:34:34,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.0) internal successors, (1227), 3 states have internal predecessors, (1227), 0 states have call successors, (0), 0 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-06 09:34:34,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:34,996 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-06 09:34:34,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:34:34,996 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-06 09:34:34,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1701085061, now seen corresponding path program 1 times [2025-02-06 09:34:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992004031] [2025-02-06 09:34:34,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:35,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:34:35,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:34:35,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:35,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:35,113 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-06 09:34:35,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992004031] [2025-02-06 09:34:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992004031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:35,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:35,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:35,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096023906] [2025-02-06 09:34:35,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:35,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:35,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:35,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:35,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:35,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 463 [2025-02-06 09:34:35,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 376 transitions, 763 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-06 09:34:35,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:35,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 463 [2025-02-06 09:34:35,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:35,683 INFO L124 PetriNetUnfolderBase]: 725/4635 cut-off events. [2025-02-06 09:34:35,683 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-06 09:34:35,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 4635 events. 725/4635 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 37442 event pairs, 548 based on Foata normal form. 0/3925 useless extension candidates. Maximal degree in co-relation 5621. Up to 1111 conditions per place. [2025-02-06 09:34:35,720 INFO L140 encePairwiseOnDemand]: 460/463 looper letters, 24 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-02-06 09:34:35,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 375 transitions, 813 flow [2025-02-06 09:34:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1293 transitions. [2025-02-06 09:34:35,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9308855291576674 [2025-02-06 09:34:35,724 INFO L175 Difference]: Start difference. First operand has 378 places, 376 transitions, 763 flow. Second operand 3 states and 1293 transitions. [2025-02-06 09:34:35,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 375 transitions, 813 flow [2025-02-06 09:34:35,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 812 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:34:35,729 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2025-02-06 09:34:35,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, 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-06 09:34:35,730 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -11 predicate places. [2025-02-06 09:34:35,730 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2025-02-06 09:34:35,731 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-06 09:34:35,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:35,731 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-06 09:34:35,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:34:35,731 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-06 09:34:35,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash 71602177, now seen corresponding path program 1 times [2025-02-06 09:34:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:35,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029855914] [2025-02-06 09:34:35,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:35,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-06 09:34:35,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-06 09:34:35,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:35,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:35,871 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-06 09:34:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029855914] [2025-02-06 09:34:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029855914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:35,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:35,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:35,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386516047] [2025-02-06 09:34:35,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:35,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:35,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:35,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:35,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:35,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 463 [2025-02-06 09:34:35,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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-06 09:34:35,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:35,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 463 [2025-02-06 09:34:35,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:36,538 INFO L124 PetriNetUnfolderBase]: 849/4475 cut-off events. [2025-02-06 09:34:36,538 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 09:34:36,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5782 conditions, 4475 events. 849/4475 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34429 event pairs, 607 based on Foata normal form. 0/3808 useless extension candidates. Maximal degree in co-relation 5625. Up to 1267 conditions per place. [2025-02-06 09:34:36,556 INFO L140 encePairwiseOnDemand]: 460/463 looper letters, 24 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2025-02-06 09:34:36,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 374 transitions, 814 flow [2025-02-06 09:34:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2025-02-06 09:34:36,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9287257019438445 [2025-02-06 09:34:36,560 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1290 transitions. [2025-02-06 09:34:36,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 374 transitions, 814 flow [2025-02-06 09:34:36,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 374 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:36,565 INFO L231 Difference]: Finished difference. Result has 377 places, 374 transitions, 762 flow [2025-02-06 09:34:36,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=377, PETRI_TRANSITIONS=374} [2025-02-06 09:34:36,566 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -12 predicate places. [2025-02-06 09:34:36,566 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 374 transitions, 762 flow [2025-02-06 09:34:36,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.3333333333333) internal successors, (1267), 3 states have internal predecessors, (1267), 0 states have call successors, (0), 0 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-06 09:34:36,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:36,568 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-06 09:34:36,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:34:36,568 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-06 09:34:36,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:36,569 INFO L85 PathProgramCache]: Analyzing trace with hash -579613781, now seen corresponding path program 1 times [2025-02-06 09:34:36,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:36,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946852966] [2025-02-06 09:34:36,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:36,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 09:34:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 09:34:36,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:36,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:36,660 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-06 09:34:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946852966] [2025-02-06 09:34:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946852966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463495636] [2025-02-06 09:34:36,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:36,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:36,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:36,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:36,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 463 [2025-02-06 09:34:36,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 374 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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-06 09:34:36,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:36,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 463 [2025-02-06 09:34:36,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:37,180 INFO L124 PetriNetUnfolderBase]: 991/4594 cut-off events. [2025-02-06 09:34:37,181 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-06 09:34:37,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6111 conditions, 4594 events. 991/4594 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 35901 event pairs, 713 based on Foata normal form. 0/3925 useless extension candidates. Maximal degree in co-relation 5954. Up to 1475 conditions per place. [2025-02-06 09:34:37,199 INFO L140 encePairwiseOnDemand]: 460/463 looper letters, 26 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-02-06 09:34:37,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 373 transitions, 816 flow [2025-02-06 09:34:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2025-02-06 09:34:37,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925845932325414 [2025-02-06 09:34:37,201 INFO L175 Difference]: Start difference. First operand has 377 places, 374 transitions, 762 flow. Second operand 3 states and 1286 transitions. [2025-02-06 09:34:37,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 373 transitions, 816 flow [2025-02-06 09:34:37,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 373 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:37,207 INFO L231 Difference]: Finished difference. Result has 376 places, 373 transitions, 760 flow [2025-02-06 09:34:37,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=376, PETRI_TRANSITIONS=373} [2025-02-06 09:34:37,210 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -13 predicate places. [2025-02-06 09:34:37,210 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 373 transitions, 760 flow [2025-02-06 09:34:37,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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-06 09:34:37,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:37,212 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-06 09:34:37,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:34:37,213 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-06 09:34:37,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash 624706954, now seen corresponding path program 1 times [2025-02-06 09:34:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34962603] [2025-02-06 09:34:37,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:37,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 09:34:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 09:34:37,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:37,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:37,296 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-06 09:34:37,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:37,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34962603] [2025-02-06 09:34:37,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34962603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:37,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:37,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78764100] [2025-02-06 09:34:37,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:37,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:37,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:37,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:37,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 463 [2025-02-06 09:34:37,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 373 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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-06 09:34:37,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:37,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 463 [2025-02-06 09:34:37,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:37,835 INFO L124 PetriNetUnfolderBase]: 1451/5104 cut-off events. [2025-02-06 09:34:37,835 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-06 09:34:37,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 5104 events. 1451/5104 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 38746 event pairs, 507 based on Foata normal form. 0/4516 useless extension candidates. Maximal degree in co-relation 7142. Up to 2100 conditions per place. [2025-02-06 09:34:37,855 INFO L140 encePairwiseOnDemand]: 455/463 looper letters, 38 selfloop transitions, 3 changer transitions 0/381 dead transitions. [2025-02-06 09:34:37,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 381 transitions, 863 flow [2025-02-06 09:34:37,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2025-02-06 09:34:37,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2025-02-06 09:34:37,858 INFO L175 Difference]: Start difference. First operand has 376 places, 373 transitions, 760 flow. Second operand 3 states and 1279 transitions. [2025-02-06 09:34:37,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 381 transitions, 863 flow [2025-02-06 09:34:37,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 381 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:37,864 INFO L231 Difference]: Finished difference. Result has 372 places, 371 transitions, 767 flow [2025-02-06 09:34:37,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=372, PETRI_TRANSITIONS=371} [2025-02-06 09:34:37,865 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -17 predicate places. [2025-02-06 09:34:37,865 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 371 transitions, 767 flow [2025-02-06 09:34:37,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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-06 09:34:37,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:37,866 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-06 09:34:37,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:34:37,866 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-06 09:34:37,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash 950566138, now seen corresponding path program 1 times [2025-02-06 09:34:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323300532] [2025-02-06 09:34:37,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:37,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-06 09:34:37,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-06 09:34:37,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:37,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:37,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:37,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323300532] [2025-02-06 09:34:37,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323300532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299281333] [2025-02-06 09:34:37,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:37,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:37,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:37,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:37,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 420 out of 463 [2025-02-06 09:34:37,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 371 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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-06 09:34:37,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:37,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 420 of 463 [2025-02-06 09:34:37,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:38,555 INFO L124 PetriNetUnfolderBase]: 971/5668 cut-off events. [2025-02-06 09:34:38,555 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-02-06 09:34:38,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 5668 events. 971/5668 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 48905 event pairs, 625 based on Foata normal form. 0/5028 useless extension candidates. Maximal degree in co-relation 7208. Up to 1488 conditions per place. [2025-02-06 09:34:38,582 INFO L140 encePairwiseOnDemand]: 457/463 looper letters, 30 selfloop transitions, 3 changer transitions 0/377 dead transitions. [2025-02-06 09:34:38,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 377 transitions, 845 flow [2025-02-06 09:34:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2025-02-06 09:34:38,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9330453563714903 [2025-02-06 09:34:38,585 INFO L175 Difference]: Start difference. First operand has 372 places, 371 transitions, 767 flow. Second operand 3 states and 1296 transitions. [2025-02-06 09:34:38,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 377 transitions, 845 flow [2025-02-06 09:34:38,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:38,590 INFO L231 Difference]: Finished difference. Result has 372 places, 371 transitions, 782 flow [2025-02-06 09:34:38,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=372, PETRI_TRANSITIONS=371} [2025-02-06 09:34:38,591 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -17 predicate places. [2025-02-06 09:34:38,591 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 371 transitions, 782 flow [2025-02-06 09:34:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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-06 09:34:38,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:38,592 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-06 09:34:38,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:34:38,592 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-06 09:34:38,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -901402684, now seen corresponding path program 1 times [2025-02-06 09:34:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353254969] [2025-02-06 09:34:38,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:38,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:34:38,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:34:38,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:38,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:38,664 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-06 09:34:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353254969] [2025-02-06 09:34:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353254969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:38,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507515427] [2025-02-06 09:34:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:38,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:38,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:38,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:38,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2025-02-06 09:34:38,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 371 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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-06 09:34:38,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:38,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2025-02-06 09:34:38,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:39,788 INFO L124 PetriNetUnfolderBase]: 1749/8014 cut-off events. [2025-02-06 09:34:39,788 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-06 09:34:39,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11092 conditions, 8014 events. 1749/8014 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 70481 event pairs, 642 based on Foata normal form. 0/6969 useless extension candidates. Maximal degree in co-relation 10935. Up to 1448 conditions per place. [2025-02-06 09:34:39,841 INFO L140 encePairwiseOnDemand]: 452/463 looper letters, 44 selfloop transitions, 8 changer transitions 0/395 dead transitions. [2025-02-06 09:34:39,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 395 transitions, 940 flow [2025-02-06 09:34:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2025-02-06 09:34:39,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424046076313894 [2025-02-06 09:34:39,845 INFO L175 Difference]: Start difference. First operand has 372 places, 371 transitions, 782 flow. Second operand 3 states and 1309 transitions. [2025-02-06 09:34:39,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 395 transitions, 940 flow [2025-02-06 09:34:39,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 395 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:39,852 INFO L231 Difference]: Finished difference. Result has 376 places, 379 transitions, 852 flow [2025-02-06 09:34:39,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=376, PETRI_TRANSITIONS=379} [2025-02-06 09:34:39,854 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -13 predicate places. [2025-02-06 09:34:39,854 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 379 transitions, 852 flow [2025-02-06 09:34:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 0 states have call successors, (0), 0 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-06 09:34:39,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:39,856 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-06 09:34:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:34:39,856 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-06 09:34:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 461194690, now seen corresponding path program 1 times [2025-02-06 09:34:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336308012] [2025-02-06 09:34:39,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-06 09:34:39,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-06 09:34:39,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:39,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:39,928 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-06 09:34:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336308012] [2025-02-06 09:34:39,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336308012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:39,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:39,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:39,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395088032] [2025-02-06 09:34:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:39,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:39,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:39,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:39,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 463 [2025-02-06 09:34:39,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 379 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 0 states have call successors, (0), 0 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-06 09:34:39,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:39,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 463 [2025-02-06 09:34:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:40,961 INFO L124 PetriNetUnfolderBase]: 2120/10593 cut-off events. [2025-02-06 09:34:40,961 INFO L125 PetriNetUnfolderBase]: For 154/162 co-relation queries the response was YES. [2025-02-06 09:34:40,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14416 conditions, 10593 events. 2120/10593 cut-off events. For 154/162 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 100750 event pairs, 1244 based on Foata normal form. 0/9490 useless extension candidates. Maximal degree in co-relation 14257. Up to 2843 conditions per place. [2025-02-06 09:34:41,026 INFO L140 encePairwiseOnDemand]: 458/463 looper letters, 35 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2025-02-06 09:34:41,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 389 transitions, 949 flow [2025-02-06 09:34:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-02-06 09:34:41,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294456443484521 [2025-02-06 09:34:41,028 INFO L175 Difference]: Start difference. First operand has 376 places, 379 transitions, 852 flow. Second operand 3 states and 1291 transitions. [2025-02-06 09:34:41,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 389 transitions, 949 flow [2025-02-06 09:34:41,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 389 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:41,036 INFO L231 Difference]: Finished difference. Result has 374 places, 378 transitions, 844 flow [2025-02-06 09:34:41,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=374, PETRI_TRANSITIONS=378} [2025-02-06 09:34:41,037 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -15 predicate places. [2025-02-06 09:34:41,037 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 378 transitions, 844 flow [2025-02-06 09:34:41,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 418.6666666666667) internal successors, (1256), 3 states have internal predecessors, (1256), 0 states have call successors, (0), 0 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-06 09:34:41,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:41,038 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-06 09:34:41,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:34:41,038 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-06 09:34:41,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:41,039 INFO L85 PathProgramCache]: Analyzing trace with hash -148544898, now seen corresponding path program 1 times [2025-02-06 09:34:41,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:41,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773565582] [2025-02-06 09:34:41,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:41,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-06 09:34:41,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-06 09:34:41,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:41,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:41,235 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-06 09:34:41,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:41,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773565582] [2025-02-06 09:34:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773565582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225892494] [2025-02-06 09:34:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:41,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:41,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:41,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:41,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:41,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2025-02-06 09:34:41,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 378 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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-06 09:34:41,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:41,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2025-02-06 09:34:41,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:43,226 INFO L124 PetriNetUnfolderBase]: 4584/20412 cut-off events. [2025-02-06 09:34:43,227 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-02-06 09:34:43,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29138 conditions, 20412 events. 4584/20412 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 219321 event pairs, 2480 based on Foata normal form. 0/18466 useless extension candidates. Maximal degree in co-relation 28978. Up to 5342 conditions per place. [2025-02-06 09:34:43,302 INFO L140 encePairwiseOnDemand]: 453/463 looper letters, 45 selfloop transitions, 9 changer transitions 0/401 dead transitions. [2025-02-06 09:34:43,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 401 transitions, 1004 flow [2025-02-06 09:34:43,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2025-02-06 09:34:43,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424046076313894 [2025-02-06 09:34:43,305 INFO L175 Difference]: Start difference. First operand has 374 places, 378 transitions, 844 flow. Second operand 3 states and 1309 transitions. [2025-02-06 09:34:43,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 401 transitions, 1004 flow [2025-02-06 09:34:43,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 401 transitions, 1004 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:43,310 INFO L231 Difference]: Finished difference. Result has 378 places, 386 transitions, 914 flow [2025-02-06 09:34:43,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=378, PETRI_TRANSITIONS=386} [2025-02-06 09:34:43,311 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -11 predicate places. [2025-02-06 09:34:43,311 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 386 transitions, 914 flow [2025-02-06 09:34:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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-06 09:34:43,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:43,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:34:43,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:34:43,312 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-06 09:34:43,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2130220564, now seen corresponding path program 1 times [2025-02-06 09:34:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589720208] [2025-02-06 09:34:43,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-06 09:34:43,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-06 09:34:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:43,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:43,471 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-06 09:34:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589720208] [2025-02-06 09:34:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589720208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:43,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834041854] [2025-02-06 09:34:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:43,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:34:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:43,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:34:43,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:34:43,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 463 [2025-02-06 09:34:43,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 386 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 422.8) internal successors, (2114), 5 states have internal predecessors, (2114), 0 states have call successors, (0), 0 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-06 09:34:43,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:43,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 463 [2025-02-06 09:34:43,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:45,521 INFO L124 PetriNetUnfolderBase]: 2611/15678 cut-off events. [2025-02-06 09:34:45,521 INFO L125 PetriNetUnfolderBase]: For 515/579 co-relation queries the response was YES. [2025-02-06 09:34:45,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22157 conditions, 15678 events. 2611/15678 cut-off events. For 515/579 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 171087 event pairs, 1904 based on Foata normal form. 4/14199 useless extension candidates. Maximal degree in co-relation 21993. Up to 3513 conditions per place. [2025-02-06 09:34:45,589 INFO L140 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 8 changer transitions 0/400 dead transitions. [2025-02-06 09:34:45,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 400 transitions, 1029 flow [2025-02-06 09:34:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2571 transitions. [2025-02-06 09:34:45,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254859611231101 [2025-02-06 09:34:45,594 INFO L175 Difference]: Start difference. First operand has 378 places, 386 transitions, 914 flow. Second operand 6 states and 2571 transitions. [2025-02-06 09:34:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 400 transitions, 1029 flow [2025-02-06 09:34:45,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 400 transitions, 1011 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:45,606 INFO L231 Difference]: Finished difference. Result has 385 places, 390 transitions, 941 flow [2025-02-06 09:34:45,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=385, PETRI_TRANSITIONS=390} [2025-02-06 09:34:45,607 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -4 predicate places. [2025-02-06 09:34:45,607 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 390 transitions, 941 flow [2025-02-06 09:34:45,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 422.8) internal successors, (2114), 5 states have internal predecessors, (2114), 0 states have call successors, (0), 0 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-06 09:34:45,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:45,608 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-06 09:34:45,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:34:45,608 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-06 09:34:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 262121943, now seen corresponding path program 1 times [2025-02-06 09:34:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533252261] [2025-02-06 09:34:45,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:45,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-06 09:34:45,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-06 09:34:45,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:45,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:45,682 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-06 09:34:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533252261] [2025-02-06 09:34:45,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533252261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:45,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:34:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2898235] [2025-02-06 09:34:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:45,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:34:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:45,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:34:45,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:34:45,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 463 [2025-02-06 09:34:45,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 390 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 430.6666666666667) internal successors, (1292), 3 states have internal predecessors, (1292), 0 states have call successors, (0), 0 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-06 09:34:45,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:45,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 463 [2025-02-06 09:34:45,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:47,901 INFO L124 PetriNetUnfolderBase]: 3169/16348 cut-off events. [2025-02-06 09:34:47,901 INFO L125 PetriNetUnfolderBase]: For 227/258 co-relation queries the response was YES. [2025-02-06 09:34:47,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23438 conditions, 16348 events. 3169/16348 cut-off events. For 227/258 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 175473 event pairs, 1835 based on Foata normal form. 2/14559 useless extension candidates. Maximal degree in co-relation 23270. Up to 3415 conditions per place. [2025-02-06 09:34:47,987 INFO L140 encePairwiseOnDemand]: 459/463 looper letters, 29 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2025-02-06 09:34:47,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 401 transitions, 1030 flow [2025-02-06 09:34:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:34:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:34:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1320 transitions. [2025-02-06 09:34:47,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503239740820735 [2025-02-06 09:34:47,989 INFO L175 Difference]: Start difference. First operand has 385 places, 390 transitions, 941 flow. Second operand 3 states and 1320 transitions. [2025-02-06 09:34:47,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 401 transitions, 1030 flow [2025-02-06 09:34:47,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 401 transitions, 1026 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:34:47,994 INFO L231 Difference]: Finished difference. Result has 388 places, 392 transitions, 959 flow [2025-02-06 09:34:47,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=959, PETRI_PLACES=388, PETRI_TRANSITIONS=392} [2025-02-06 09:34:47,995 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, -1 predicate places. [2025-02-06 09:34:47,995 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 392 transitions, 959 flow [2025-02-06 09:34:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.6666666666667) internal successors, (1292), 3 states have internal predecessors, (1292), 0 states have call successors, (0), 0 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-06 09:34:47,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:47,996 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-06 09:34:47,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:34:47,996 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-06 09:34:47,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2124289960, now seen corresponding path program 1 times [2025-02-06 09:34:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:47,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695915393] [2025-02-06 09:34:47,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:47,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-06 09:34:48,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-06 09:34:48,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:48,312 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-06 09:34:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695915393] [2025-02-06 09:34:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695915393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:48,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352112410] [2025-02-06 09:34:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:34:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:48,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:34:48,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:34:48,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 463 [2025-02-06 09:34:48,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 392 transitions, 959 flow. Second operand has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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-06 09:34:48,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:48,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 463 [2025-02-06 09:34:48,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:50,885 INFO L124 PetriNetUnfolderBase]: 3869/20017 cut-off events. [2025-02-06 09:34:50,886 INFO L125 PetriNetUnfolderBase]: For 738/770 co-relation queries the response was YES. [2025-02-06 09:34:50,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29439 conditions, 20017 events. 3869/20017 cut-off events. For 738/770 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 222548 event pairs, 2584 based on Foata normal form. 6/18222 useless extension candidates. Maximal degree in co-relation 29268. Up to 5217 conditions per place. [2025-02-06 09:34:50,976 INFO L140 encePairwiseOnDemand]: 454/463 looper letters, 27 selfloop transitions, 4 changer transitions 17/404 dead transitions. [2025-02-06 09:34:50,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 404 transitions, 1074 flow [2025-02-06 09:34:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2572 transitions. [2025-02-06 09:34:50,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925845932325414 [2025-02-06 09:34:50,980 INFO L175 Difference]: Start difference. First operand has 388 places, 392 transitions, 959 flow. Second operand 6 states and 2572 transitions. [2025-02-06 09:34:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 404 transitions, 1074 flow [2025-02-06 09:34:50,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 404 transitions, 1068 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:34:50,991 INFO L231 Difference]: Finished difference. Result has 393 places, 387 transitions, 940 flow [2025-02-06 09:34:50,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=393, PETRI_TRANSITIONS=387} [2025-02-06 09:34:50,992 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 4 predicate places. [2025-02-06 09:34:50,992 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 387 transitions, 940 flow [2025-02-06 09:34:50,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 423.0) internal successors, (2115), 5 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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-06 09:34:50,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:50,993 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-06 09:34:50,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:34:50,994 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-06 09:34:50,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1932733408, now seen corresponding path program 1 times [2025-02-06 09:34:50,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:50,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711761710] [2025-02-06 09:34:50,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:51,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-06 09:34:51,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-06 09:34:51,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:51,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:51,642 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-06 09:34:51,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:51,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711761710] [2025-02-06 09:34:51,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711761710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:51,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136773853] [2025-02-06 09:34:51,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:51,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:51,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:51,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:51,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 463 [2025-02-06 09:34:51,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 387 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 406.8333333333333) internal successors, (2441), 6 states have internal predecessors, (2441), 0 states have call successors, (0), 0 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-06 09:34:51,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:51,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 463 [2025-02-06 09:34:51,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:56,071 INFO L124 PetriNetUnfolderBase]: 9082/31677 cut-off events. [2025-02-06 09:34:56,072 INFO L125 PetriNetUnfolderBase]: For 2421/2539 co-relation queries the response was YES. [2025-02-06 09:34:56,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53009 conditions, 31677 events. 9082/31677 cut-off events. For 2421/2539 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 353604 event pairs, 3937 based on Foata normal form. 1/28750 useless extension candidates. Maximal degree in co-relation 52834. Up to 11134 conditions per place. [2025-02-06 09:34:56,222 INFO L140 encePairwiseOnDemand]: 449/463 looper letters, 95 selfloop transitions, 46 changer transitions 0/483 dead transitions. [2025-02-06 09:34:56,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 483 transitions, 1496 flow [2025-02-06 09:34:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2555 transitions. [2025-02-06 09:34:56,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197264218862491 [2025-02-06 09:34:56,225 INFO L175 Difference]: Start difference. First operand has 393 places, 387 transitions, 940 flow. Second operand 6 states and 2555 transitions. [2025-02-06 09:34:56,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 483 transitions, 1496 flow [2025-02-06 09:34:56,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 483 transitions, 1468 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-02-06 09:34:56,241 INFO L231 Difference]: Finished difference. Result has 389 places, 432 transitions, 1247 flow [2025-02-06 09:34:56,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1247, PETRI_PLACES=389, PETRI_TRANSITIONS=432} [2025-02-06 09:34:56,242 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 0 predicate places. [2025-02-06 09:34:56,242 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 432 transitions, 1247 flow [2025-02-06 09:34:56,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.8333333333333) internal successors, (2441), 6 states have internal predecessors, (2441), 0 states have call successors, (0), 0 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-06 09:34:56,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:56,243 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-06 09:34:56,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:34:56,243 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-06 09:34:56,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1685718220, now seen corresponding path program 1 times [2025-02-06 09:34:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155410895] [2025-02-06 09:34:56,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:56,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-06 09:34:56,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-06 09:34:56,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:56,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:56,439 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-06 09:34:56,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:56,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155410895] [2025-02-06 09:34:56,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155410895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:56,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:56,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:34:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387022051] [2025-02-06 09:34:56,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:56,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:34:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:56,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:34:56,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:34:56,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 463 [2025-02-06 09:34:56,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 432 transitions, 1247 flow. Second operand has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 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-06 09:34:56,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:56,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 463 [2025-02-06 09:34:56,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:02,233 INFO L124 PetriNetUnfolderBase]: 9762/40485 cut-off events. [2025-02-06 09:35:02,233 INFO L125 PetriNetUnfolderBase]: For 3913/6012 co-relation queries the response was YES. [2025-02-06 09:35:02,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67506 conditions, 40485 events. 9762/40485 cut-off events. For 3913/6012 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 496742 event pairs, 4575 based on Foata normal form. 257/36578 useless extension candidates. Maximal degree in co-relation 67337. Up to 10939 conditions per place. [2025-02-06 09:35:02,494 INFO L140 encePairwiseOnDemand]: 451/463 looper letters, 64 selfloop transitions, 14 changer transitions 10/481 dead transitions. [2025-02-06 09:35:02,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 481 transitions, 1526 flow [2025-02-06 09:35:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 09:35:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 09:35:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4228 transitions. [2025-02-06 09:35:02,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9131749460043197 [2025-02-06 09:35:02,500 INFO L175 Difference]: Start difference. First operand has 389 places, 432 transitions, 1247 flow. Second operand 10 states and 4228 transitions. [2025-02-06 09:35:02,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 481 transitions, 1526 flow [2025-02-06 09:35:02,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 481 transitions, 1526 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:35:02,517 INFO L231 Difference]: Finished difference. Result has 402 places, 439 transitions, 1314 flow [2025-02-06 09:35:02,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1314, PETRI_PLACES=402, PETRI_TRANSITIONS=439} [2025-02-06 09:35:02,517 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 13 predicate places. [2025-02-06 09:35:02,518 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 439 transitions, 1314 flow [2025-02-06 09:35:02,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 0 states have call successors, (0), 0 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-06 09:35:02,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:02,519 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-06 09:35:02,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:35:02,519 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-06 09:35:02,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:02,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1891631103, now seen corresponding path program 1 times [2025-02-06 09:35:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:02,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724066777] [2025-02-06 09:35:02,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:02,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 09:35:02,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 09:35:02,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:02,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:02,847 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-06 09:35:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724066777] [2025-02-06 09:35:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724066777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:02,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:35:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825472241] [2025-02-06 09:35:02,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:02,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:35:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:35:02,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:35:03,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 463 [2025-02-06 09:35:03,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 439 transitions, 1314 flow. Second operand has 8 states, 8 states have (on average 410.875) internal successors, (3287), 8 states have internal predecessors, (3287), 0 states have call successors, (0), 0 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-06 09:35:03,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:03,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 463 [2025-02-06 09:35:03,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:09,490 INFO L124 PetriNetUnfolderBase]: 11533/46197 cut-off events. [2025-02-06 09:35:09,490 INFO L125 PetriNetUnfolderBase]: For 15901/18062 co-relation queries the response was YES. [2025-02-06 09:35:09,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86425 conditions, 46197 events. 11533/46197 cut-off events. For 15901/18062 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 566861 event pairs, 4008 based on Foata normal form. 118/42501 useless extension candidates. Maximal degree in co-relation 86250. Up to 8375 conditions per place. [2025-02-06 09:35:09,793 INFO L140 encePairwiseOnDemand]: 450/463 looper letters, 101 selfloop transitions, 44 changer transitions 0/509 dead transitions. [2025-02-06 09:35:09,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 509 transitions, 1896 flow [2025-02-06 09:35:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:35:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:35:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4595 transitions. [2025-02-06 09:35:09,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022187315923818 [2025-02-06 09:35:09,798 INFO L175 Difference]: Start difference. First operand has 402 places, 439 transitions, 1314 flow. Second operand 11 states and 4595 transitions. [2025-02-06 09:35:09,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 509 transitions, 1896 flow [2025-02-06 09:35:09,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 509 transitions, 1888 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:35:09,821 INFO L231 Difference]: Finished difference. Result has 412 places, 460 transitions, 1631 flow [2025-02-06 09:35:09,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1631, PETRI_PLACES=412, PETRI_TRANSITIONS=460} [2025-02-06 09:35:09,822 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 23 predicate places. [2025-02-06 09:35:09,822 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 460 transitions, 1631 flow [2025-02-06 09:35:09,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 410.875) internal successors, (3287), 8 states have internal predecessors, (3287), 0 states have call successors, (0), 0 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-06 09:35:09,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:09,824 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-06 09:35:09,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:35:09,824 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-06 09:35:09,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1291082021, now seen corresponding path program 1 times [2025-02-06 09:35:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:09,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541482650] [2025-02-06 09:35:09,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:09,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:09,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-06 09:35:09,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-06 09:35:09,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:09,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:09,875 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-06 09:35:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:09,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541482650] [2025-02-06 09:35:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541482650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:35:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547032097] [2025-02-06 09:35:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:35:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:09,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:35:09,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:35:09,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 463 [2025-02-06 09:35:09,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 460 transitions, 1631 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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-06 09:35:09,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:09,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 463 [2025-02-06 09:35:09,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:11,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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], [145#L1066-3true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), 455#true, Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), 244#L1040-2true, Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 478#true, Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:11,729 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is not cut-off event [2025-02-06 09:35:11,729 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-02-06 09:35:11,729 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-02-06 09:35:11,729 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-02-06 09:35:11,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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][386], [322#L1043-5true, 312#L1066-6true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:11,886 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-02-06 09:35:11,886 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:11,886 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:11,886 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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][386], [322#L1043-5true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 132#L1066-5true, Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 531#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:11,898 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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][386], [312#L1066-6true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), 389#L1043-4true, Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 531#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:11,898 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:11,898 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,125 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([936] 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][386], [322#L1043-5true, 312#L1066-6true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 531#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,126 INFO L294 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-02-06 09:35:12,126 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-02-06 09:35:12,126 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:12,126 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:12,126 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:12,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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][386], [322#L1043-5true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 478#true, Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 295#L1066-4true, Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,127 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-06 09:35:12,127 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,127 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,127 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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][386], [Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 132#L1066-5true, Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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))), 389#L1043-4true, Black: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:12,128 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-06 09:35:12,128 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,128 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,128 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,142 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([936] 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][386], [322#L1043-5true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 132#L1066-5true, Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,142 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-06 09:35:12,142 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,142 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,142 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,142 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:35:12,143 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([936] 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][386], [312#L1066-6true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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))), 389#L1043-4true, Black: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,143 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-02-06 09:35:12,143 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,143 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,143 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:12,143 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:35:12,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([936] 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][386], [Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 478#true, Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 295#L1066-4true, Black: 553#(not (= ~flags~0.base ~tids~0.base)), 389#L1043-4true, Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 531#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:12,144 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-02-06 09:35:12,144 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:12,144 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:12,144 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([936] 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][386], [322#L1043-5true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, 295#L1066-4true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,159 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([936] 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][386], [Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), 570#true, Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 132#L1066-5true, Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), 389#L1043-4true, Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,159 INFO L294 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:12,159 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:35:12,177 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([936] 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][386], [Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, 295#L1066-4true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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))), 389#L1043-4true, Black: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:12,177 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-02-06 09:35:12,177 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:12,177 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-02-06 09:35:12,177 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:12,177 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:14,963 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([936] 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][386], [322#L1043-5true, 312#L1066-6true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:14,963 INFO L294 olderBase$Statistics]: this new event has 412 ancestors and is cut-off event [2025-02-06 09:35:14,963 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-02-06 09:35:14,963 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-02-06 09:35:14,963 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:14,963 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:14,963 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-02-06 09:35:14,974 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([936] 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][386], [322#L1043-5true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 132#L1066-5true, Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:14,974 INFO L294 olderBase$Statistics]: this new event has 413 ancestors and is cut-off event [2025-02-06 09:35:14,974 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:14,974 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:14,974 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:14,974 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:35:14,974 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:35:14,975 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([936] 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][386], [312#L1066-6true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), 389#L1043-4true, Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:14,975 INFO L294 olderBase$Statistics]: this new event has 413 ancestors and is cut-off event [2025-02-06 09:35:14,975 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:14,975 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:14,975 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:35:14,975 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-02-06 09:35:14,975 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-02-06 09:35:14,984 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([936] 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][386], [322#L1043-5true, Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, 295#L1066-4true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:14,985 INFO L294 olderBase$Statistics]: this new event has 414 ancestors and is cut-off event [2025-02-06 09:35:14,985 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:14,985 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:14,985 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:35:14,985 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:14,985 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:35:14,986 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([936] 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][386], [Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), 132#L1066-5true, Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 553#(not (= ~flags~0.base ~tids~0.base)), 389#L1043-4true, Black: 565#(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: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 464#(= |#race~threads_total~0| 0), 521#true, 531#true, 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(= |#race~data~0| 0), 342#L1034true]) [2025-02-06 09:35:14,986 INFO L294 olderBase$Statistics]: this new event has 414 ancestors and is cut-off event [2025-02-06 09:35:14,986 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:35:14,986 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:14,986 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:14,986 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-02-06 09:35:14,986 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-02-06 09:35:14,996 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([936] 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][386], [Black: 523#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|), Black: 526#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 455#true, Black: 525#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), Black: 524#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet31#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet31#1|)), 489#(= |#race~flags~0| 0), 480#(= |#race~tids~0| 0), Black: 474#true, 476#(= |#race~flags_mutex~0| 0), Black: 537#(= |cleanerThread1of1ForFork1_#t~mem11| 0), 570#true, Black: 478#true, Black: 536#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 543#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 535#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 484#(= |#race~threads_alive~0| 0), 457#true, Black: 487#true, Black: 493#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 295#L1066-4true, Black: 553#(not (= ~flags~0.base ~tids~0.base)), Black: 565#(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))), 389#L1043-4true, Black: 554#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 498#(= |ULTIMATE.start_main_~i~2#1| 0), 521#true, 464#(= |#race~threads_total~0| 0), 563#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 531#true, 342#L1034true, Black: 509#(= |#race~data~0| 0)]) [2025-02-06 09:35:14,996 INFO L294 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-02-06 09:35:14,996 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:14,996 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-02-06 09:35:14,996 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:14,996 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-06 09:35:14,996 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-02-06 09:35:15,059 INFO L124 PetriNetUnfolderBase]: 7494/33619 cut-off events. [2025-02-06 09:35:15,059 INFO L125 PetriNetUnfolderBase]: For 13925/17439 co-relation queries the response was YES. [2025-02-06 09:35:15,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62113 conditions, 33619 events. 7494/33619 cut-off events. For 13925/17439 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 414091 event pairs, 3643 based on Foata normal form. 107/31128 useless extension candidates. Maximal degree in co-relation 61936. Up to 7812 conditions per place. [2025-02-06 09:35:15,257 INFO L140 encePairwiseOnDemand]: 458/463 looper letters, 32 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-02-06 09:35:15,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 473 transitions, 1733 flow [2025-02-06 09:35:15,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:35:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:35:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1318 transitions. [2025-02-06 09:35:15,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488840892728582 [2025-02-06 09:35:15,258 INFO L175 Difference]: Start difference. First operand has 412 places, 460 transitions, 1631 flow. Second operand 3 states and 1318 transitions. [2025-02-06 09:35:15,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 473 transitions, 1733 flow [2025-02-06 09:35:15,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 473 transitions, 1722 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:35:15,300 INFO L231 Difference]: Finished difference. Result has 410 places, 463 transitions, 1656 flow [2025-02-06 09:35:15,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1656, PETRI_PLACES=410, PETRI_TRANSITIONS=463} [2025-02-06 09:35:15,300 INFO L279 CegarLoopForPetriNet]: 389 programPoint places, 21 predicate places. [2025-02-06 09:35:15,300 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 463 transitions, 1656 flow [2025-02-06 09:35:15,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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-06 09:35:15,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:15,301 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-06 09:35:15,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:35:15,301 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-06 09:35:15,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1880225669, now seen corresponding path program 1 times [2025-02-06 09:35:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607328968] [2025-02-06 09:35:15,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:35:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:15,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-06 09:35:15,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 09:35:15,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:35:15,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:15,793 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-06 09:35:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607328968] [2025-02-06 09:35:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607328968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:35:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:35:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:35:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251526292] [2025-02-06 09:35:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:35:15,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:35:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:35:15,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:35:15,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:35:16,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 463 [2025-02-06 09:35:16,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 463 transitions, 1656 flow. Second operand has 11 states, 11 states have (on average 399.72727272727275) internal successors, (4397), 11 states have internal predecessors, (4397), 0 states have call successors, (0), 0 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-06 09:35:16,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:16,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 463 [2025-02-06 09:35:16,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand