./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:27:58,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:27:58,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:27:58,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:27:58,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:27:58,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:27:58,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:27:58,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:27:58,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:27:58,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:27:58,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:27:58,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:27:58,922 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:27:58,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:27:58,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:27:58,922 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:27:58,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:27:58,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:27:58,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:27:58,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:27:58,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:27:58,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:27:58,924 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:27:58,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:27:58,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:27:58,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:27:58,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:27:58,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e [2025-03-13 22:27:59,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:27:59,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:27:59,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:27:59,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:27:59,217 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:27:59,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2025-03-13 22:28:00,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe1a13de/f0fd5df1ec5949b39fde88b1e2751775/FLAG508dd6c99 [2025-03-13 22:28:00,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:28:00,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2025-03-13 22:28:00,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe1a13de/f0fd5df1ec5949b39fde88b1e2751775/FLAG508dd6c99 [2025-03-13 22:28:00,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe1a13de/f0fd5df1ec5949b39fde88b1e2751775 [2025-03-13 22:28:00,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:28:00,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:28:00,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:00,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:28:00,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:28:00,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58db30cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00, skipping insertion in model container [2025-03-13 22:28:00,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:28:01,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:01,138 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:28:01,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:01,200 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:28:01,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01 WrapperNode [2025-03-13 22:28:01,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:01,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:01,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:28:01,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:28:01,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,228 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-13 22:28:01,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:01,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:28:01,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:28:01,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:28:01,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:28:01,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:28:01,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:28:01,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:28:01,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (1/1) ... [2025-03-13 22:28:01,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:28:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:28:01,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:28:01,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:28:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:28:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:28:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:28:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:28:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:28:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:28:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:28:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:28:01,295 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:28:01,384 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:28:01,386 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:28:01,553 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:28:01,554 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:28:01,554 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:28:01,568 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:28:01,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:01 BoogieIcfgContainer [2025-03-13 22:28:01,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:28:01,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:28:01,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:28:01,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:28:01,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:28:00" (1/3) ... [2025-03-13 22:28:01,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3352b52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:01, skipping insertion in model container [2025-03-13 22:28:01,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:01" (2/3) ... [2025-03-13 22:28:01,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3352b52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:01, skipping insertion in model container [2025-03-13 22:28:01,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:01" (3/3) ... [2025-03-13 22:28:01,577 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i [2025-03-13 22:28:01,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:28:01,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race.i that has 2 procedures, 93 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-13 22:28:01,591 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:28:01,644 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:28:01,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 95 transitions, 197 flow [2025-03-13 22:28:01,722 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2025-03-13 22:28:01,726 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:28:01,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 2/128 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 231 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-03-13 22:28:01,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 95 transitions, 197 flow [2025-03-13 22:28:01,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 95 transitions, 197 flow [2025-03-13 22:28:01,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:01,755 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;@11f27f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:01,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:28:01,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:01,770 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-13 22:28:01,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:01,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:01,771 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] [2025-03-13 22:28:01,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1644893429, now seen corresponding path program 1 times [2025-03-13 22:28:01,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:01,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874833308] [2025-03-13 22:28:01,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:01,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:28:01,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:28:01,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:01,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:01,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:01,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874833308] [2025-03-13 22:28:01,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874833308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:01,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:01,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487516326] [2025-03-13 22:28:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:02,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:02,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:02,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2025-03-13 22:28:02,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:02,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:02,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2025-03-13 22:28:02,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:02,110 INFO L124 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-03-13 22:28:02,110 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:28:02,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 162 events. 3/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 333 event pairs, 2 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 102. Up to 15 conditions per place. [2025-03-13 22:28:02,113 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 8 selfloop transitions, 2 changer transitions 1/93 dead transitions. [2025-03-13 22:28:02,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 213 flow [2025-03-13 22:28:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2025-03-13 22:28:02,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-03-13 22:28:02,128 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 197 flow. Second operand 3 states and 261 transitions. [2025-03-13 22:28:02,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 213 flow [2025-03-13 22:28:02,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 213 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:02,143 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 195 flow [2025-03-13 22:28:02,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2025-03-13 22:28:02,147 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 1 predicate places. [2025-03-13 22:28:02,148 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 195 flow [2025-03-13 22:28:02,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:02,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:02,148 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] [2025-03-13 22:28:02,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:28:02,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:02,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2078690088, now seen corresponding path program 1 times [2025-03-13 22:28:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691781065] [2025-03-13 22:28:02,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:02,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:02,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:02,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:02,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:02,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:02,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691781065] [2025-03-13 22:28:02,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691781065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:02,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:02,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614762046] [2025-03-13 22:28:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:02,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:02,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:02,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:02,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:02,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2025-03-13 22:28:02,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:02,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:02,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2025-03-13 22:28:02,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:02,301 INFO L124 PetriNetUnfolderBase]: 5/170 cut-off events. [2025-03-13 22:28:02,301 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:28:02,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 339 event pairs, 2 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 165. Up to 16 conditions per place. [2025-03-13 22:28:02,302 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 7 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-13 22:28:02,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 213 flow [2025-03-13 22:28:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-03-13 22:28:02,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-13 22:28:02,305 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 195 flow. Second operand 3 states and 266 transitions. [2025-03-13 22:28:02,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 213 flow [2025-03-13 22:28:02,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:02,308 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 201 flow [2025-03-13 22:28:02,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-03-13 22:28:02,309 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-03-13 22:28:02,309 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 201 flow [2025-03-13 22:28:02,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:02,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:02,310 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] [2025-03-13 22:28:02,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:28:02,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:02,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:02,311 INFO L85 PathProgramCache]: Analyzing trace with hash -964185328, now seen corresponding path program 1 times [2025-03-13 22:28:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:02,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748316624] [2025-03-13 22:28:02,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:02,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:02,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:02,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:02,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748316624] [2025-03-13 22:28:02,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748316624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:02,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:02,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:02,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543345069] [2025-03-13 22:28:02,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:02,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:02,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:02,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:02,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:02,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 95 [2025-03-13 22:28:02,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:02,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:02,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 95 [2025-03-13 22:28:02,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:03,087 INFO L124 PetriNetUnfolderBase]: 73/403 cut-off events. [2025-03-13 22:28:03,087 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:28:03,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 403 events. 73/403 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1945 event pairs, 35 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 502. Up to 159 conditions per place. [2025-03-13 22:28:03,090 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 23 selfloop transitions, 22 changer transitions 0/113 dead transitions. [2025-03-13 22:28:03,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 113 transitions, 333 flow [2025-03-13 22:28:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-03-13 22:28:03,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175438596491228 [2025-03-13 22:28:03,092 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 201 flow. Second operand 6 states and 466 transitions. [2025-03-13 22:28:03,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 113 transitions, 333 flow [2025-03-13 22:28:03,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 113 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:03,095 INFO L231 Difference]: Finished difference. Result has 105 places, 113 transitions, 351 flow [2025-03-13 22:28:03,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=105, PETRI_TRANSITIONS=113} [2025-03-13 22:28:03,095 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 9 predicate places. [2025-03-13 22:28:03,095 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 113 transitions, 351 flow [2025-03-13 22:28:03,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:03,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:03,096 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] [2025-03-13 22:28:03,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:28:03,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:03,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -43522275, now seen corresponding path program 1 times [2025-03-13 22:28:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360852485] [2025-03-13 22:28:03,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:03,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:03,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:03,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360852485] [2025-03-13 22:28:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360852485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:03,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045186019] [2025-03-13 22:28:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:03,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:03,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:03,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:03,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 95 [2025-03-13 22:28:03,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 113 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:03,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:03,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 95 [2025-03-13 22:28:03,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:03,348 INFO L124 PetriNetUnfolderBase]: 34/263 cut-off events. [2025-03-13 22:28:03,348 INFO L125 PetriNetUnfolderBase]: For 37/45 co-relation queries the response was YES. [2025-03-13 22:28:03,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 263 events. 34/263 cut-off events. For 37/45 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 925 event pairs, 0 based on Foata normal form. 2/255 useless extension candidates. Maximal degree in co-relation 336. Up to 49 conditions per place. [2025-03-13 22:28:03,354 INFO L140 encePairwiseOnDemand]: 87/95 looper letters, 11 selfloop transitions, 2 changer transitions 5/118 dead transitions. [2025-03-13 22:28:03,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 118 transitions, 397 flow [2025-03-13 22:28:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2025-03-13 22:28:03,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8859649122807017 [2025-03-13 22:28:03,355 INFO L175 Difference]: Start difference. First operand has 105 places, 113 transitions, 351 flow. Second operand 6 states and 505 transitions. [2025-03-13 22:28:03,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 118 transitions, 397 flow [2025-03-13 22:28:03,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 397 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:03,360 INFO L231 Difference]: Finished difference. Result has 114 places, 113 transitions, 369 flow [2025-03-13 22:28:03,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=114, PETRI_TRANSITIONS=113} [2025-03-13 22:28:03,361 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 18 predicate places. [2025-03-13 22:28:03,362 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 113 transitions, 369 flow [2025-03-13 22:28:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:03,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:03,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:03,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:28:03,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:03,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1268041548, now seen corresponding path program 1 times [2025-03-13 22:28:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464406474] [2025-03-13 22:28:03,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:03,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:28:03,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:28:03,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:03,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:03,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464406474] [2025-03-13 22:28:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464406474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514191367] [2025-03-13 22:28:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:03,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:03,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:03,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-03-13 22:28:03,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 113 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:03,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:03,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-03-13 22:28:03,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:03,884 INFO L124 PetriNetUnfolderBase]: 139/525 cut-off events. [2025-03-13 22:28:03,884 INFO L125 PetriNetUnfolderBase]: For 147/149 co-relation queries the response was YES. [2025-03-13 22:28:03,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 525 events. 139/525 cut-off events. For 147/149 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2734 event pairs, 31 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 1078. Up to 257 conditions per place. [2025-03-13 22:28:03,888 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 36 selfloop transitions, 48 changer transitions 12/156 dead transitions. [2025-03-13 22:28:03,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 156 transitions, 693 flow [2025-03-13 22:28:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2025-03-13 22:28:03,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8631578947368421 [2025-03-13 22:28:03,890 INFO L175 Difference]: Start difference. First operand has 114 places, 113 transitions, 369 flow. Second operand 6 states and 492 transitions. [2025-03-13 22:28:03,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 156 transitions, 693 flow [2025-03-13 22:28:03,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 679 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:03,897 INFO L231 Difference]: Finished difference. Result has 116 places, 144 transitions, 712 flow [2025-03-13 22:28:03,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=116, PETRI_TRANSITIONS=144} [2025-03-13 22:28:03,898 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2025-03-13 22:28:03,898 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 144 transitions, 712 flow [2025-03-13 22:28:03,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:03,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:03,900 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] [2025-03-13 22:28:03,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:28:03,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:03,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1431591250, now seen corresponding path program 1 times [2025-03-13 22:28:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872061974] [2025-03-13 22:28:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:03,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:28:03,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:28:03,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:03,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872061974] [2025-03-13 22:28:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872061974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373749173] [2025-03-13 22:28:04,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:04,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:04,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-03-13 22:28:04,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 144 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-03-13 22:28:04,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:04,373 INFO L124 PetriNetUnfolderBase]: 142/515 cut-off events. [2025-03-13 22:28:04,374 INFO L125 PetriNetUnfolderBase]: For 445/451 co-relation queries the response was YES. [2025-03-13 22:28:04,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 515 events. 142/515 cut-off events. For 445/451 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2839 event pairs, 10 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1507. Up to 241 conditions per place. [2025-03-13 22:28:04,378 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 73 selfloop transitions, 25 changer transitions 13/172 dead transitions. [2025-03-13 22:28:04,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 172 transitions, 1095 flow [2025-03-13 22:28:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2025-03-13 22:28:04,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-13 22:28:04,380 INFO L175 Difference]: Start difference. First operand has 116 places, 144 transitions, 712 flow. Second operand 6 states and 475 transitions. [2025-03-13 22:28:04,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 172 transitions, 1095 flow [2025-03-13 22:28:04,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 172 transitions, 1076 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-13 22:28:04,391 INFO L231 Difference]: Finished difference. Result has 115 places, 159 transitions, 928 flow [2025-03-13 22:28:04,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=115, PETRI_TRANSITIONS=159} [2025-03-13 22:28:04,393 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2025-03-13 22:28:04,393 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 159 transitions, 928 flow [2025-03-13 22:28:04,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,394 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:28:04,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:28:04,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:04,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1341094899, now seen corresponding path program 1 times [2025-03-13 22:28:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717643816] [2025-03-13 22:28:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:28:04,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:28:04,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:04,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:28:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:28:04,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:28:04,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:04,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:28:04,451 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:28:04,451 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 22:28:04,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 22:28:04,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 22:28:04,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:28:04,453 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:04,455 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:28:04,458 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:28:04,478 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:28:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 117 transitions, 250 flow [2025-03-13 22:28:04,502 INFO L124 PetriNetUnfolderBase]: 4/218 cut-off events. [2025-03-13 22:28:04,502 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-13 22:28:04,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 218 events. 4/218 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 497 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 130. Up to 6 conditions per place. [2025-03-13 22:28:04,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 117 transitions, 250 flow [2025-03-13 22:28:04,504 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 117 transitions, 250 flow [2025-03-13 22:28:04,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:04,504 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;@11f27f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:04,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-13 22:28:04,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:04,507 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-13 22:28:04,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:04,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:04,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash 670760608, now seen corresponding path program 1 times [2025-03-13 22:28:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376780130] [2025-03-13 22:28:04,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:28:04,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:28:04,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376780130] [2025-03-13 22:28:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376780130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900895451] [2025-03-13 22:28:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:04,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:04,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:04,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-03-13 22:28:04,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-03-13 22:28:04,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:04,592 INFO L124 PetriNetUnfolderBase]: 19/443 cut-off events. [2025-03-13 22:28:04,592 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 22:28:04,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 443 events. 19/443 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1874 event pairs, 16 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 289. Up to 50 conditions per place. [2025-03-13 22:28:04,594 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/115 dead transitions. [2025-03-13 22:28:04,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 272 flow [2025-03-13 22:28:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2025-03-13 22:28:04,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2025-03-13 22:28:04,596 INFO L175 Difference]: Start difference. First operand has 119 places, 117 transitions, 250 flow. Second operand 3 states and 321 transitions. [2025-03-13 22:28:04,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 272 flow [2025-03-13 22:28:04,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:04,600 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 248 flow [2025-03-13 22:28:04,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2025-03-13 22:28:04,601 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2025-03-13 22:28:04,601 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 248 flow [2025-03-13 22:28:04,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,602 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] [2025-03-13 22:28:04,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:28:04,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 647627720, now seen corresponding path program 1 times [2025-03-13 22:28:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633380351] [2025-03-13 22:28:04,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:04,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:04,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633380351] [2025-03-13 22:28:04,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633380351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809961414] [2025-03-13 22:28:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:04,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:04,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:04,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-03-13 22:28:04,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-03-13 22:28:04,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:04,689 INFO L124 PetriNetUnfolderBase]: 48/635 cut-off events. [2025-03-13 22:28:04,689 INFO L125 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2025-03-13 22:28:04,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 635 events. 48/635 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3278 event pairs, 28 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 729. Up to 97 conditions per place. [2025-03-13 22:28:04,693 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-03-13 22:28:04,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 285 flow [2025-03-13 22:28:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-13 22:28:04,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-03-13 22:28:04,694 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 248 flow. Second operand 3 states and 324 transitions. [2025-03-13 22:28:04,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 285 flow [2025-03-13 22:28:04,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:04,696 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 259 flow [2025-03-13 22:28:04,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2025-03-13 22:28:04,697 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2025-03-13 22:28:04,697 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 259 flow [2025-03-13 22:28:04,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,699 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] [2025-03-13 22:28:04,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:28:04,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1825582512, now seen corresponding path program 1 times [2025-03-13 22:28:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383197836] [2025-03-13 22:28:04,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:04,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:04,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383197836] [2025-03-13 22:28:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383197836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81280156] [2025-03-13 22:28:04,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:04,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:04,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:04,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2025-03-13 22:28:04,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:04,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2025-03-13 22:28:04,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:05,344 INFO L124 PetriNetUnfolderBase]: 1014/3175 cut-off events. [2025-03-13 22:28:05,344 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 22:28:05,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 3175 events. 1014/3175 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 26246 event pairs, 586 based on Foata normal form. 0/2852 useless extension candidates. Maximal degree in co-relation 4122. Up to 1592 conditions per place. [2025-03-13 22:28:05,356 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 30 selfloop transitions, 38 changer transitions 0/152 dead transitions. [2025-03-13 22:28:05,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 476 flow [2025-03-13 22:28:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2025-03-13 22:28:05,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-13 22:28:05,358 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 259 flow. Second operand 6 states and 585 transitions. [2025-03-13 22:28:05,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 476 flow [2025-03-13 22:28:05,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 152 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:05,360 INFO L231 Difference]: Finished difference. Result has 127 places, 151 transitions, 513 flow [2025-03-13 22:28:05,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=127, PETRI_TRANSITIONS=151} [2025-03-13 22:28:05,361 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 8 predicate places. [2025-03-13 22:28:05,361 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 151 transitions, 513 flow [2025-03-13 22:28:05,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:05,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:05,361 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] [2025-03-13 22:28:05,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:28:05,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -904919459, now seen corresponding path program 1 times [2025-03-13 22:28:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:05,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756240610] [2025-03-13 22:28:05,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:05,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:05,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:05,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:05,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:05,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756240610] [2025-03-13 22:28:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756240610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:05,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:05,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:05,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523881856] [2025-03-13 22:28:05,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:05,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:05,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:05,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:05,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 117 [2025-03-13 22:28:05,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 151 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:05,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:05,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 117 [2025-03-13 22:28:05,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:05,705 INFO L124 PetriNetUnfolderBase]: 481/1750 cut-off events. [2025-03-13 22:28:05,705 INFO L125 PetriNetUnfolderBase]: For 359/436 co-relation queries the response was YES. [2025-03-13 22:28:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3222 conditions, 1750 events. 481/1750 cut-off events. For 359/436 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12402 event pairs, 131 based on Foata normal form. 2/1653 useless extension candidates. Maximal degree in co-relation 2644. Up to 612 conditions per place. [2025-03-13 22:28:05,714 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/157 dead transitions. [2025-03-13 22:28:05,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 157 transitions, 567 flow [2025-03-13 22:28:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2025-03-13 22:28:05,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945868945868946 [2025-03-13 22:28:05,716 INFO L175 Difference]: Start difference. First operand has 127 places, 151 transitions, 513 flow. Second operand 6 states and 628 transitions. [2025-03-13 22:28:05,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 157 transitions, 567 flow [2025-03-13 22:28:05,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 157 transitions, 567 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:05,721 INFO L231 Difference]: Finished difference. Result has 136 places, 152 transitions, 535 flow [2025-03-13 22:28:05,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=136, PETRI_TRANSITIONS=152} [2025-03-13 22:28:05,723 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2025-03-13 22:28:05,723 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 152 transitions, 535 flow [2025-03-13 22:28:05,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:05,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:05,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:05,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:28:05,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:05,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1777089333, now seen corresponding path program 1 times [2025-03-13 22:28:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:05,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211683833] [2025-03-13 22:28:05,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:05,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:28:05,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:28:05,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:05,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:05,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211683833] [2025-03-13 22:28:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211683833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965846591] [2025-03-13 22:28:05,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:05,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:05,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:05,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:06,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-03-13 22:28:06,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 152 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:06,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:06,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-03-13 22:28:06,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:06,794 INFO L124 PetriNetUnfolderBase]: 2551/7155 cut-off events. [2025-03-13 22:28:06,794 INFO L125 PetriNetUnfolderBase]: For 1972/2641 co-relation queries the response was YES. [2025-03-13 22:28:06,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15614 conditions, 7155 events. 2551/7155 cut-off events. For 1972/2641 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 65625 event pairs, 634 based on Foata normal form. 22/6612 useless extension candidates. Maximal degree in co-relation 15512. Up to 3079 conditions per place. [2025-03-13 22:28:06,856 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 87 selfloop transitions, 86 changer transitions 0/262 dead transitions. [2025-03-13 22:28:06,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 262 transitions, 1365 flow [2025-03-13 22:28:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2025-03-13 22:28:06,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-03-13 22:28:06,858 INFO L175 Difference]: Start difference. First operand has 136 places, 152 transitions, 535 flow. Second operand 6 states and 630 transitions. [2025-03-13 22:28:06,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 262 transitions, 1365 flow [2025-03-13 22:28:06,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 262 transitions, 1353 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:28:06,874 INFO L231 Difference]: Finished difference. Result has 138 places, 235 transitions, 1249 flow [2025-03-13 22:28:06,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1249, PETRI_PLACES=138, PETRI_TRANSITIONS=235} [2025-03-13 22:28:06,875 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2025-03-13 22:28:06,875 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 235 transitions, 1249 flow [2025-03-13 22:28:06,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:06,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:06,876 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] [2025-03-13 22:28:06,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:28:06,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1000244635, now seen corresponding path program 1 times [2025-03-13 22:28:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:06,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687470369] [2025-03-13 22:28:06,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:06,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:28:06,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:28:06,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:06,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:07,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687470369] [2025-03-13 22:28:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687470369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:07,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:07,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888464483] [2025-03-13 22:28:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:07,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:07,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:07,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:07,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-03-13 22:28:07,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 235 transitions, 1249 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:07,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:07,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-03-13 22:28:07,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:08,146 INFO L124 PetriNetUnfolderBase]: 3068/8919 cut-off events. [2025-03-13 22:28:08,147 INFO L125 PetriNetUnfolderBase]: For 7036/7442 co-relation queries the response was YES. [2025-03-13 22:28:08,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24687 conditions, 8919 events. 3068/8919 cut-off events. For 7036/7442 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 89002 event pairs, 530 based on Foata normal form. 23/8354 useless extension candidates. Maximal degree in co-relation 23714. Up to 4185 conditions per place. [2025-03-13 22:28:08,208 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/303 dead transitions. [2025-03-13 22:28:08,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 303 transitions, 2105 flow [2025-03-13 22:28:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2025-03-13 22:28:08,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490028490028491 [2025-03-13 22:28:08,211 INFO L175 Difference]: Start difference. First operand has 138 places, 235 transitions, 1249 flow. Second operand 6 states and 596 transitions. [2025-03-13 22:28:08,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 303 transitions, 2105 flow [2025-03-13 22:28:08,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 303 transitions, 2087 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:08,287 INFO L231 Difference]: Finished difference. Result has 148 places, 301 transitions, 2011 flow [2025-03-13 22:28:08,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2011, PETRI_PLACES=148, PETRI_TRANSITIONS=301} [2025-03-13 22:28:08,288 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2025-03-13 22:28:08,288 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 301 transitions, 2011 flow [2025-03-13 22:28:08,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:08,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:08,293 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:28:08,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:28:08,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:08,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash -126091836, now seen corresponding path program 1 times [2025-03-13 22:28:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528543292] [2025-03-13 22:28:08,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:08,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:28:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:28:08,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:08,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:08,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528543292] [2025-03-13 22:28:08,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528543292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:08,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:08,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:08,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343159802] [2025-03-13 22:28:08,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:08,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:08,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:08,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:08,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:09,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2025-03-13 22:28:09,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 301 transitions, 2011 flow. Second operand has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:09,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2025-03-13 22:28:09,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:10,234 INFO L124 PetriNetUnfolderBase]: 3381/9647 cut-off events. [2025-03-13 22:28:10,234 INFO L125 PetriNetUnfolderBase]: For 13219/13824 co-relation queries the response was YES. [2025-03-13 22:28:10,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30617 conditions, 9647 events. 3381/9647 cut-off events. For 13219/13824 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 96537 event pairs, 480 based on Foata normal form. 145/9219 useless extension candidates. Maximal degree in co-relation 29344. Up to 3013 conditions per place. [2025-03-13 22:28:10,302 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 310 selfloop transitions, 36 changer transitions 0/432 dead transitions. [2025-03-13 22:28:10,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 432 transitions, 3905 flow [2025-03-13 22:28:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:28:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:28:10,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1100 transitions. [2025-03-13 22:28:10,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7232084155161078 [2025-03-13 22:28:10,305 INFO L175 Difference]: Start difference. First operand has 148 places, 301 transitions, 2011 flow. Second operand 13 states and 1100 transitions. [2025-03-13 22:28:10,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 432 transitions, 3905 flow [2025-03-13 22:28:10,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 432 transitions, 3765 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:10,346 INFO L231 Difference]: Finished difference. Result has 159 places, 300 transitions, 1939 flow [2025-03-13 22:28:10,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1939, PETRI_PLACES=159, PETRI_TRANSITIONS=300} [2025-03-13 22:28:10,347 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2025-03-13 22:28:10,347 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 300 transitions, 1939 flow [2025-03-13 22:28:10,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:10,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:10,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2025-03-13 22:28:10,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:28:10,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:10,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2077561470, now seen corresponding path program 1 times [2025-03-13 22:28:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715987557] [2025-03-13 22:28:10,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:10,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:10,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:28:10,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:28:10,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:10,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:10,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:10,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715987557] [2025-03-13 22:28:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715987557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944270216] [2025-03-13 22:28:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:10,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:10,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:10,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:11,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 117 [2025-03-13 22:28:11,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 300 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:11,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:11,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 117 [2025-03-13 22:28:11,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:12,512 INFO L124 PetriNetUnfolderBase]: 5303/13450 cut-off events. [2025-03-13 22:28:12,512 INFO L125 PetriNetUnfolderBase]: For 19133/23085 co-relation queries the response was YES. [2025-03-13 22:28:12,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45139 conditions, 13450 events. 5303/13450 cut-off events. For 19133/23085 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 132772 event pairs, 734 based on Foata normal form. 403/13281 useless extension candidates. Maximal degree in co-relation 41126. Up to 3240 conditions per place. [2025-03-13 22:28:12,608 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 342 selfloop transitions, 262 changer transitions 6/691 dead transitions. [2025-03-13 22:28:12,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 691 transitions, 6043 flow [2025-03-13 22:28:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 22:28:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 22:28:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1614 transitions. [2025-03-13 22:28:12,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7663817663817664 [2025-03-13 22:28:12,612 INFO L175 Difference]: Start difference. First operand has 159 places, 300 transitions, 1939 flow. Second operand 18 states and 1614 transitions. [2025-03-13 22:28:12,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 691 transitions, 6043 flow [2025-03-13 22:28:12,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 691 transitions, 5899 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-13 22:28:12,681 INFO L231 Difference]: Finished difference. Result has 174 places, 506 transitions, 4575 flow [2025-03-13 22:28:12,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4575, PETRI_PLACES=174, PETRI_TRANSITIONS=506} [2025-03-13 22:28:12,682 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2025-03-13 22:28:12,682 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 506 transitions, 4575 flow [2025-03-13 22:28:12,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:12,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:12,683 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] [2025-03-13 22:28:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:28:12,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1677027141, now seen corresponding path program 1 times [2025-03-13 22:28:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026485809] [2025-03-13 22:28:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:12,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:28:12,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:28:12,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:12,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026485809] [2025-03-13 22:28:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026485809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:13,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:13,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2635088] [2025-03-13 22:28:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:13,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:13,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:13,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:13,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:13,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 117 [2025-03-13 22:28:13,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 506 transitions, 4575 flow. Second operand has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:13,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:13,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 117 [2025-03-13 22:28:13,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:14,959 INFO L124 PetriNetUnfolderBase]: 4489/12065 cut-off events. [2025-03-13 22:28:14,959 INFO L125 PetriNetUnfolderBase]: For 34543/35459 co-relation queries the response was YES. [2025-03-13 22:28:15,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48065 conditions, 12065 events. 4489/12065 cut-off events. For 34543/35459 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 121193 event pairs, 443 based on Foata normal form. 233/11720 useless extension candidates. Maximal degree in co-relation 46686. Up to 3243 conditions per place. [2025-03-13 22:28:15,048 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/658 dead transitions. [2025-03-13 22:28:15,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 658 transitions, 7538 flow [2025-03-13 22:28:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:28:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:28:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2025-03-13 22:28:15,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7389875082182774 [2025-03-13 22:28:15,051 INFO L175 Difference]: Start difference. First operand has 174 places, 506 transitions, 4575 flow. Second operand 13 states and 1124 transitions. [2025-03-13 22:28:15,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 658 transitions, 7538 flow [2025-03-13 22:28:15,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 658 transitions, 7460 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:15,186 INFO L231 Difference]: Finished difference. Result has 180 places, 505 transitions, 4589 flow [2025-03-13 22:28:15,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4589, PETRI_PLACES=180, PETRI_TRANSITIONS=505} [2025-03-13 22:28:15,188 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2025-03-13 22:28:15,188 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 505 transitions, 4589 flow [2025-03-13 22:28:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:15,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:15,189 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:28:15,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:28:15,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:15,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -736365576, now seen corresponding path program 1 times [2025-03-13 22:28:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:15,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466731850] [2025-03-13 22:28:15,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:15,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:28:15,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:28:15,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:15,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:28:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466731850] [2025-03-13 22:28:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466731850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:15,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:15,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:15,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871284666] [2025-03-13 22:28:15,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:15,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2025-03-13 22:28:15,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 505 transitions, 4589 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:15,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:15,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2025-03-13 22:28:15,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:16,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread2of2ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_9, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_9, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} AuxVars[] AssignedVars[#race][333], [Black: 125#true, 161#true, Black: 132#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 131#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 133#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 134#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 118#true, 265#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 49#L1023-5true, Black: 142#(= |ULTIMATE.start_main_~i~1#1| 0), 103#L1023-2true, Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 204#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 156#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), 120#true, Black: 155#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 225#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 205#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 199#true, Black: 221#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 206#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 207#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 219#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 223#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 163#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 209#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 151#true, 241#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 35#L1037true, 129#true, 127#(= |#race~datas~0| 0)]) [2025-03-13 22:28:16,265 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2025-03-13 22:28:16,265 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-13 22:28:16,265 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-13 22:28:16,265 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-13 22:28:17,961 INFO L124 PetriNetUnfolderBase]: 9973/22501 cut-off events. [2025-03-13 22:28:17,961 INFO L125 PetriNetUnfolderBase]: For 76409/77536 co-relation queries the response was YES. [2025-03-13 22:28:18,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91931 conditions, 22501 events. 9973/22501 cut-off events. For 76409/77536 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 229286 event pairs, 1237 based on Foata normal form. 11/21319 useless extension candidates. Maximal degree in co-relation 89867. Up to 11550 conditions per place. [2025-03-13 22:28:18,122 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 363 selfloop transitions, 352 changer transitions 15/862 dead transitions. [2025-03-13 22:28:18,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 862 transitions, 9423 flow [2025-03-13 22:28:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2025-03-13 22:28:18,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917378917378918 [2025-03-13 22:28:18,124 INFO L175 Difference]: Start difference. First operand has 180 places, 505 transitions, 4589 flow. Second operand 6 states and 626 transitions. [2025-03-13 22:28:18,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 862 transitions, 9423 flow [2025-03-13 22:28:18,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 862 transitions, 9187 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-13 22:28:18,426 INFO L231 Difference]: Finished difference. Result has 177 places, 777 transitions, 8304 flow [2025-03-13 22:28:18,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8304, PETRI_PLACES=177, PETRI_TRANSITIONS=777} [2025-03-13 22:28:18,427 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 58 predicate places. [2025-03-13 22:28:18,427 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 777 transitions, 8304 flow [2025-03-13 22:28:18,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:18,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:18,428 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-13 22:28:18,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:28:18,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:18,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 393097034, now seen corresponding path program 1 times [2025-03-13 22:28:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552583380] [2025-03-13 22:28:18,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:18,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:28:18,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:28:18,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:18,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:28:18,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:28:18,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:28:18,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:18,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:28:18,458 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-13 22:28:18,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-13 22:28:18,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:28:18,460 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:18,460 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:28:18,460 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:28:18,483 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:28:18,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 139 transitions, 305 flow [2025-03-13 22:28:18,502 INFO L124 PetriNetUnfolderBase]: 9/359 cut-off events. [2025-03-13 22:28:18,502 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-03-13 22:28:18,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 359 events. 9/359 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1047 event pairs, 1 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 226. Up to 12 conditions per place. [2025-03-13 22:28:18,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 139 transitions, 305 flow [2025-03-13 22:28:18,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 139 transitions, 305 flow [2025-03-13 22:28:18,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:18,509 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;@11f27f27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:18,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-13 22:28:18,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:18,510 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-13 22:28:18,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:18,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:18,511 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] [2025-03-13 22:28:18,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:18,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash -212366325, now seen corresponding path program 1 times [2025-03-13 22:28:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417887381] [2025-03-13 22:28:18,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:18,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:28:18,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:28:18,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:18,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:18,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417887381] [2025-03-13 22:28:18,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417887381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:18,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:18,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:18,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498682724] [2025-03-13 22:28:18,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:18,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:18,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:18,541 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-03-13 22:28:18,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 305 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:18,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:18,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-03-13 22:28:18,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:18,616 INFO L124 PetriNetUnfolderBase]: 90/1263 cut-off events. [2025-03-13 22:28:18,616 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-13 22:28:18,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1263 events. 90/1263 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8395 event pairs, 81 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 880. Up to 178 conditions per place. [2025-03-13 22:28:18,623 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 14 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2025-03-13 22:28:18,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 333 flow [2025-03-13 22:28:18,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2025-03-13 22:28:18,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9136690647482014 [2025-03-13 22:28:18,624 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 305 flow. Second operand 3 states and 381 transitions. [2025-03-13 22:28:18,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 333 flow [2025-03-13 22:28:18,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:18,626 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 303 flow [2025-03-13 22:28:18,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2025-03-13 22:28:18,626 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2025-03-13 22:28:18,626 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 303 flow [2025-03-13 22:28:18,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:18,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:18,627 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] [2025-03-13 22:28:18,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:28:18,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:18,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash 195586856, now seen corresponding path program 1 times [2025-03-13 22:28:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:18,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565223465] [2025-03-13 22:28:18,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:18,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:18,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:18,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565223465] [2025-03-13 22:28:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565223465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161671473] [2025-03-13 22:28:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:18,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:18,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:18,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 139 [2025-03-13 22:28:18,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:18,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:18,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 139 [2025-03-13 22:28:18,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:18,879 INFO L124 PetriNetUnfolderBase]: 307/2366 cut-off events. [2025-03-13 22:28:18,879 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-03-13 22:28:18,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 2366 events. 307/2366 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 19152 event pairs, 207 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 2954. Up to 508 conditions per place. [2025-03-13 22:28:18,888 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 17 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-03-13 22:28:18,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 361 flow [2025-03-13 22:28:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-03-13 22:28:18,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9160671462829736 [2025-03-13 22:28:18,892 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 303 flow. Second operand 3 states and 382 transitions. [2025-03-13 22:28:18,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 361 flow [2025-03-13 22:28:18,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:18,894 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 319 flow [2025-03-13 22:28:18,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2025-03-13 22:28:18,894 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -3 predicate places. [2025-03-13 22:28:18,894 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 319 flow [2025-03-13 22:28:18,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:18,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:18,895 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] [2025-03-13 22:28:18,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:28:18,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:18,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1849815824, now seen corresponding path program 1 times [2025-03-13 22:28:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758286856] [2025-03-13 22:28:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:18,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:18,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:18,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:19,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:19,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:19,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758286856] [2025-03-13 22:28:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758286856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:19,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142246565] [2025-03-13 22:28:19,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:19,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:19,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:19,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:19,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 139 [2025-03-13 22:28:19,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:19,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:19,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 139 [2025-03-13 22:28:19,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:21,374 INFO L124 PetriNetUnfolderBase]: 10297/23846 cut-off events. [2025-03-13 22:28:21,375 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2025-03-13 22:28:21,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39812 conditions, 23846 events. 10297/23846 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 243261 event pairs, 6717 based on Foata normal form. 0/21803 useless extension candidates. Maximal degree in co-relation 32226. Up to 14086 conditions per place. [2025-03-13 22:28:21,479 INFO L140 encePairwiseOnDemand]: 120/139 looper letters, 37 selfloop transitions, 54 changer transitions 0/191 dead transitions. [2025-03-13 22:28:21,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 191 transitions, 623 flow [2025-03-13 22:28:21,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2025-03-13 22:28:21,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8441247002398081 [2025-03-13 22:28:21,481 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 319 flow. Second operand 6 states and 704 transitions. [2025-03-13 22:28:21,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 191 transitions, 623 flow [2025-03-13 22:28:21,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 191 transitions, 623 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:21,484 INFO L231 Difference]: Finished difference. Result has 149 places, 189 transitions, 677 flow [2025-03-13 22:28:21,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=677, PETRI_PLACES=149, PETRI_TRANSITIONS=189} [2025-03-13 22:28:21,485 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 7 predicate places. [2025-03-13 22:28:21,485 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 189 transitions, 677 flow [2025-03-13 22:28:21,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:21,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:21,485 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] [2025-03-13 22:28:21,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:28:21,485 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:21,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:21,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1524488419, now seen corresponding path program 1 times [2025-03-13 22:28:21,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052111268] [2025-03-13 22:28:21,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:21,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:21,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:21,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:21,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:21,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:21,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:21,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052111268] [2025-03-13 22:28:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052111268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:21,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605382588] [2025-03-13 22:28:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:21,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:21,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:21,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:21,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 139 [2025-03-13 22:28:21,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 189 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:21,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:21,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 139 [2025-03-13 22:28:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:22,507 INFO L124 PetriNetUnfolderBase]: 4764/12610 cut-off events. [2025-03-13 22:28:22,508 INFO L125 PetriNetUnfolderBase]: For 3019/3423 co-relation queries the response was YES. [2025-03-13 22:28:22,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24113 conditions, 12610 events. 4764/12610 cut-off events. For 3019/3423 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 121028 event pairs, 1869 based on Foata normal form. 2/11904 useless extension candidates. Maximal degree in co-relation 19682. Up to 5616 conditions per place. [2025-03-13 22:28:22,586 INFO L140 encePairwiseOnDemand]: 131/139 looper letters, 16 selfloop transitions, 2 changer transitions 5/195 dead transitions. [2025-03-13 22:28:22,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 195 transitions, 735 flow [2025-03-13 22:28:22,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2025-03-13 22:28:22,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992805755395683 [2025-03-13 22:28:22,588 INFO L175 Difference]: Start difference. First operand has 149 places, 189 transitions, 677 flow. Second operand 6 states and 750 transitions. [2025-03-13 22:28:22,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 195 transitions, 735 flow [2025-03-13 22:28:22,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 195 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:22,606 INFO L231 Difference]: Finished difference. Result has 158 places, 190 transitions, 699 flow [2025-03-13 22:28:22,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=699, PETRI_PLACES=158, PETRI_TRANSITIONS=190} [2025-03-13 22:28:22,607 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 16 predicate places. [2025-03-13 22:28:22,607 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 190 transitions, 699 flow [2025-03-13 22:28:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:22,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:22,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:22,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:28:22,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:22,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2011683468, now seen corresponding path program 1 times [2025-03-13 22:28:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072371697] [2025-03-13 22:28:22,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:22,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:28:22,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:28:22,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:22,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:22,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072371697] [2025-03-13 22:28:22,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072371697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:22,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775561014] [2025-03-13 22:28:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:22,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:22,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:22,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:22,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-03-13 22:28:22,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 190 transitions, 699 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:22,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:22,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-03-13 22:28:22,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:26,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][294], [Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 139#true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 29#L1032-3true, 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 169#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 36#L1023-4true, Black: 166#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 152#true, Black: 167#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 174#true, 150#(= |#race~datas~0| 0), 25#L1023-2true, 143#true, 141#true, Black: 148#true, 163#true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2025-03-13 22:28:26,090 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-03-13 22:28:26,090 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:26,090 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:26,090 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:26,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][294], [Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 139#true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 29#L1032-3true, 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 169#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 152#true, Black: 166#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 174#true, Black: 167#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 150#(= |#race~datas~0| 0), 25#L1023-2true, 4#L1023-3true, 143#true, 141#true, Black: 148#true, 163#true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2025-03-13 22:28:26,289 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,289 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,289 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,289 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][235], [Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 139#true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 29#L1032-3true, 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 169#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 166#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 152#true, Black: 167#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 174#true, 150#(= |#race~datas~0| 0), 17#L1023-5true, 143#true, 141#true, Black: 148#true, 127#L1024true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 163#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2025-03-13 22:28:26,439 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,439 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,439 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,439 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:26,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][294], [Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 139#true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 29#L1032-3true, 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 169#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 166#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 152#true, Black: 167#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 174#true, 150#(= |#race~datas~0| 0), 25#L1023-2true, 143#true, 141#true, Black: 148#true, 103#L1023-1true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 163#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2025-03-13 22:28:26,471 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-03-13 22:28:26,471 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:26,471 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:26,471 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:27,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][235], [Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 139#true, Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 29#L1032-3true, 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 169#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 36#L1023-4true, Black: 166#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 152#true, Black: 167#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), 174#true, 150#(= |#race~datas~0| 0), 143#true, 141#true, Black: 148#true, 127#L1024true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 163#true, Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2025-03-13 22:28:27,992 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-03-13 22:28:27,992 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:27,992 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:27,992 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:29,039 INFO L124 PetriNetUnfolderBase]: 30436/70382 cut-off events. [2025-03-13 22:28:29,040 INFO L125 PetriNetUnfolderBase]: For 20362/25494 co-relation queries the response was YES. [2025-03-13 22:28:29,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158227 conditions, 70382 events. 30436/70382 cut-off events. For 20362/25494 co-relation queries the response was YES. Maximal size of possible extension queue 2172. Compared 815528 event pairs, 7875 based on Foata normal form. 103/65035 useless extension candidates. Maximal degree in co-relation 158124. Up to 30655 conditions per place. [2025-03-13 22:28:29,698 INFO L140 encePairwiseOnDemand]: 116/139 looper letters, 129 selfloop transitions, 118 changer transitions 0/352 dead transitions. [2025-03-13 22:28:29,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 352 transitions, 1965 flow [2025-03-13 22:28:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2025-03-13 22:28:29,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9064748201438849 [2025-03-13 22:28:29,699 INFO L175 Difference]: Start difference. First operand has 158 places, 190 transitions, 699 flow. Second operand 6 states and 756 transitions. [2025-03-13 22:28:29,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 352 transitions, 1965 flow [2025-03-13 22:28:29,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 352 transitions, 1953 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:28:29,802 INFO L231 Difference]: Finished difference. Result has 160 places, 307 transitions, 1760 flow [2025-03-13 22:28:29,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1760, PETRI_PLACES=160, PETRI_TRANSITIONS=307} [2025-03-13 22:28:29,802 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2025-03-13 22:28:29,802 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 307 transitions, 1760 flow [2025-03-13 22:28:29,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:29,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:29,803 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] [2025-03-13 22:28:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:28:29,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:29,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 317442682, now seen corresponding path program 1 times [2025-03-13 22:28:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:29,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703505725] [2025-03-13 22:28:29,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:29,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:28:29,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:28:29,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:29,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:29,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:29,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703505725] [2025-03-13 22:28:29,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703505725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:29,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:29,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526858073] [2025-03-13 22:28:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:29,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:29,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:29,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:29,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:30,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2025-03-13 22:28:30,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 307 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:30,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:30,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2025-03-13 22:28:30,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:38,477 INFO L124 PetriNetUnfolderBase]: 35346/83326 cut-off events. [2025-03-13 22:28:38,477 INFO L125 PetriNetUnfolderBase]: For 74547/79715 co-relation queries the response was YES. [2025-03-13 22:28:38,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242819 conditions, 83326 events. 35346/83326 cut-off events. For 74547/79715 co-relation queries the response was YES. Maximal size of possible extension queue 2613. Compared 1012186 event pairs, 8915 based on Foata normal form. 242/77776 useless extension candidates. Maximal degree in co-relation 232820. Up to 43559 conditions per place. [2025-03-13 22:28:39,203 INFO L140 encePairwiseOnDemand]: 120/139 looper letters, 192 selfloop transitions, 110 changer transitions 0/415 dead transitions. [2025-03-13 22:28:39,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 415 transitions, 3092 flow [2025-03-13 22:28:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2025-03-13 22:28:39,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8573141486810552 [2025-03-13 22:28:39,204 INFO L175 Difference]: Start difference. First operand has 160 places, 307 transitions, 1760 flow. Second operand 6 states and 715 transitions. [2025-03-13 22:28:39,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 415 transitions, 3092 flow [2025-03-13 22:28:39,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 415 transitions, 3074 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:39,665 INFO L231 Difference]: Finished difference. Result has 170 places, 412 transitions, 2987 flow [2025-03-13 22:28:39,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2987, PETRI_PLACES=170, PETRI_TRANSITIONS=412} [2025-03-13 22:28:39,665 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2025-03-13 22:28:39,665 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 412 transitions, 2987 flow [2025-03-13 22:28:39,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:39,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:39,666 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2025-03-13 22:28:39,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:28:39,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:39,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:39,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1628732935, now seen corresponding path program 1 times [2025-03-13 22:28:39,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:39,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87328295] [2025-03-13 22:28:39,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:39,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:39,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 22:28:39,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 22:28:39,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:39,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87328295] [2025-03-13 22:28:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87328295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:39,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:39,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783570948] [2025-03-13 22:28:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:40,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:40,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:40,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 139 [2025-03-13 22:28:40,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 412 transitions, 2987 flow. Second operand has 11 states, 11 states have (on average 96.18181818181819) internal successors, (1058), 11 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:28:40,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:40,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 139 [2025-03-13 22:28:40,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:45,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][380], [Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 139#true, Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 152#true, 174#true, Black: 148#true, 103#L1023-1true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), 43#L1023-1true, 150#(= |#race~datas~0| 0), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 143#true, 141#true, Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 123#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 184#true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0)]) [2025-03-13 22:28:45,964 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2025-03-13 22:28:45,964 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:45,964 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:45,964 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-13 22:28:47,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][380], [Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 139#true, Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 152#true, 174#true, Black: 148#true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), 43#L1023-1true, 150#(= |#race~datas~0| 0), 4#L1023-3true, Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 143#true, 141#true, Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 123#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 184#true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0)]) [2025-03-13 22:28:47,404 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-03-13 22:28:47,404 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:47,404 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:47,404 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:48,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][387], [Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 139#true, Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 152#true, 174#true, Black: 148#true, 103#L1023-1true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), 25#L1023-2true, Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 143#true, 141#true, Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 123#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 184#true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0)]) [2025-03-13 22:28:48,169 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2025-03-13 22:28:48,169 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:48,169 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:48,169 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-03-13 22:28:48,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([455] L1023-6-->L1023-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][380], [Black: 187#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 139#true, Black: 188#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 213#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 109#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 152#true, 174#true, Black: 148#true, 103#L1023-1true, Black: 154#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 156#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 157#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 155#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 122#L1023-5true, Black: 165#(= |ULTIMATE.start_main_~i~1#1| 0), 150#(= |#race~datas~0| 0), Black: 177#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 143#true, 141#true, Black: 179#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), Black: 178#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 123#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 184#true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0)]) [2025-03-13 22:28:48,460 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-03-13 22:28:48,460 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:48,460 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:48,460 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event