./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:07:47,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:07:47,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:07:47,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:07:47,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:07:47,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:07:47,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:07:47,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:07:47,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:07:47,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:07:47,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:07:47,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:07:47,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:07:47,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:07:47,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:47,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:07:47,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:07:47,804 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-03-08 22:07:48,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:07:48,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:07:48,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:07:48,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:07:48,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:07:48,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-08 22:07:49,255 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b345756ab/6fa74049afc245859fd33f38c438b81b/FLAG3ead07fd2 [2025-03-08 22:07:49,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:07:49,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-08 22:07:49,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b345756ab/6fa74049afc245859fd33f38c438b81b/FLAG3ead07fd2 [2025-03-08 22:07:49,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b345756ab/6fa74049afc245859fd33f38c438b81b [2025-03-08 22:07:49,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:07:49,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:07:49,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:49,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:07:49,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:07:49,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fea6ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49, skipping insertion in model container [2025-03-08 22:07:49,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:07:49,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:49,735 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:07:49,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:07:49,784 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:07:49,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49 WrapperNode [2025-03-08 22:07:49,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:07:49,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:49,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:07:49,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:07:49,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,819 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 265 [2025-03-08 22:07:49,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:07:49,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:07:49,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:07:49,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:07:49,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:07:49,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:07:49,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:07:49,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:07:49,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (1/1) ... [2025-03-08 22:07:49,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:07:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:07:49,884 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-08 22:07:49,889 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-08 22:07:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:07:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:07:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:07:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:07:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:07:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:07:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:07:49,907 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:07:50,001 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:07:50,003 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:07:50,543 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:07:50,543 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:07:50,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:07:50,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:07:50,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:50 BoogieIcfgContainer [2025-03-08 22:07:50,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:07:50,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:07:50,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:07:50,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:07:50,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:07:49" (1/3) ... [2025-03-08 22:07:50,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da8f1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:50, skipping insertion in model container [2025-03-08 22:07:50,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:07:49" (2/3) ... [2025-03-08 22:07:50,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da8f1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:07:50, skipping insertion in model container [2025-03-08 22:07:50,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:07:50" (3/3) ... [2025-03-08 22:07:50,570 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-03-08 22:07:50,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:07:50,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 7 loop locations, and 44 error locations. [2025-03-08 22:07:50,584 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:07:50,692 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:07:50,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 506 transitions, 1033 flow [2025-03-08 22:07:50,900 INFO L124 PetriNetUnfolderBase]: 23/503 cut-off events. [2025-03-08 22:07:50,902 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:07:50,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 503 events. 23/503 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 750 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 392. Up to 2 conditions per place. [2025-03-08 22:07:50,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 506 transitions, 1033 flow [2025-03-08 22:07:50,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 484 transitions, 986 flow [2025-03-08 22:07:50,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:07:50,925 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;@12701673, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:07:50,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-03-08 22:07:50,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:07:50,931 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-08 22:07:50,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:07:50,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:50,936 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-08 22:07:50,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:50,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2130532765, now seen corresponding path program 1 times [2025-03-08 22:07:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866502930] [2025-03-08 22:07:50,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:51,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:07:51,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:07:51,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:51,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:51,081 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-08 22:07:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866502930] [2025-03-08 22:07:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866502930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621191515] [2025-03-08 22:07:51,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:51,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:51,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:51,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:51,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 506 [2025-03-08 22:07:51,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 484 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-08 22:07:51,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:51,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 506 [2025-03-08 22:07:51,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:51,283 INFO L124 PetriNetUnfolderBase]: 23/763 cut-off events. [2025-03-08 22:07:51,283 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-08 22:07:51,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 763 events. 23/763 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2652 event pairs, 7 based on Foata normal form. 22/669 useless extension candidates. Maximal degree in co-relation 423. Up to 31 conditions per place. [2025-03-08 22:07:51,294 INFO L140 encePairwiseOnDemand]: 490/506 looper letters, 13 selfloop transitions, 2 changer transitions 10/470 dead transitions. [2025-03-08 22:07:51,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 470 transitions, 988 flow [2025-03-08 22:07:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2025-03-08 22:07:51,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.955862977602108 [2025-03-08 22:07:51,317 INFO L175 Difference]: Start difference. First operand has 472 places, 484 transitions, 986 flow. Second operand 3 states and 1451 transitions. [2025-03-08 22:07:51,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 470 transitions, 988 flow [2025-03-08 22:07:51,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 470 transitions, 976 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:07:51,335 INFO L231 Difference]: Finished difference. Result has 467 places, 460 transitions, 930 flow [2025-03-08 22:07:51,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=467, PETRI_TRANSITIONS=460} [2025-03-08 22:07:51,341 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -5 predicate places. [2025-03-08 22:07:51,343 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 460 transitions, 930 flow [2025-03-08 22:07:51,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-08 22:07:51,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:51,345 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] [2025-03-08 22:07:51,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:07:51,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:51,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -908848578, now seen corresponding path program 1 times [2025-03-08 22:07:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929739521] [2025-03-08 22:07:51,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:51,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:07:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:07:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:51,392 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-08 22:07:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:51,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929739521] [2025-03-08 22:07:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929739521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:51,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586375886] [2025-03-08 22:07:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:51,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:51,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 506 [2025-03-08 22:07:51,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 460 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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-08 22:07:51,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:51,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 506 [2025-03-08 22:07:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:51,527 INFO L124 PetriNetUnfolderBase]: 17/604 cut-off events. [2025-03-08 22:07:51,527 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:07:51,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 604 events. 17/604 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1638 event pairs, 5 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 615. Up to 31 conditions per place. [2025-03-08 22:07:51,531 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 17 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2025-03-08 22:07:51,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 459 transitions, 966 flow [2025-03-08 22:07:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1430 transitions. [2025-03-08 22:07:51,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-03-08 22:07:51,536 INFO L175 Difference]: Start difference. First operand has 467 places, 460 transitions, 930 flow. Second operand 3 states and 1430 transitions. [2025-03-08 22:07:51,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 459 transitions, 966 flow [2025-03-08 22:07:51,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 459 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:51,543 INFO L231 Difference]: Finished difference. Result has 456 places, 459 transitions, 928 flow [2025-03-08 22:07:51,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=459} [2025-03-08 22:07:51,544 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2025-03-08 22:07:51,544 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 459 transitions, 928 flow [2025-03-08 22:07:51,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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-08 22:07:51,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:51,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:51,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:07:51,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:51,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1039160016, now seen corresponding path program 1 times [2025-03-08 22:07:51,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:51,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554290175] [2025-03-08 22:07:51,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:51,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:07:51,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:07:51,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:51,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:51,581 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-08 22:07:51,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554290175] [2025-03-08 22:07:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554290175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43927584] [2025-03-08 22:07:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:51,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:51,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:51,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:51,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 506 [2025-03-08 22:07:51,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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-08 22:07:51,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:51,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 506 [2025-03-08 22:07:51,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:51,734 INFO L124 PetriNetUnfolderBase]: 29/735 cut-off events. [2025-03-08 22:07:51,734 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:07:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 735 events. 29/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2633 event pairs, 12 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 763. Up to 54 conditions per place. [2025-03-08 22:07:51,741 INFO L140 encePairwiseOnDemand]: 497/506 looper letters, 22 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2025-03-08 22:07:51,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 958 flow [2025-03-08 22:07:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:51,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2025-03-08 22:07:51,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9295125164690382 [2025-03-08 22:07:51,744 INFO L175 Difference]: Start difference. First operand has 456 places, 459 transitions, 928 flow. Second operand 3 states and 1411 transitions. [2025-03-08 22:07:51,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 958 flow [2025-03-08 22:07:51,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:51,749 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-03-08 22:07:51,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-03-08 22:07:51,750 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2025-03-08 22:07:51,750 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-03-08 22:07:51,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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-08 22:07:51,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:51,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:51,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:07:51,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 548303638, now seen corresponding path program 1 times [2025-03-08 22:07:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:51,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914367855] [2025-03-08 22:07:51,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:51,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:07:51,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:07:51,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:52,277 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-08 22:07:52,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914367855] [2025-03-08 22:07:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914367855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:52,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:52,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731417581] [2025-03-08 22:07:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:52,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:52,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:52,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 506 [2025-03-08 22:07:52,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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-08 22:07:52,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:52,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 506 [2025-03-08 22:07:52,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,048 INFO L124 PetriNetUnfolderBase]: 5286/18348 cut-off events. [2025-03-08 22:07:55,049 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2025-03-08 22:07:55,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26429 conditions, 18348 events. 5286/18348 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 207171 event pairs, 4536 based on Foata normal form. 0/15640 useless extension candidates. Maximal degree in co-relation 26391. Up to 7875 conditions per place. [2025-03-08 22:07:55,171 INFO L140 encePairwiseOnDemand]: 482/506 looper letters, 82 selfloop transitions, 20 changer transitions 0/447 dead transitions. [2025-03-08 22:07:55,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 1106 flow [2025-03-08 22:07:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:07:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:07:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2416 transitions. [2025-03-08 22:07:55,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7957839262187089 [2025-03-08 22:07:55,175 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2416 transitions. [2025-03-08 22:07:55,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 1106 flow [2025-03-08 22:07:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:55,181 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 941 flow [2025-03-08 22:07:55,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2025-03-08 22:07:55,182 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2025-03-08 22:07:55,183 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 941 flow [2025-03-08 22:07:55,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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-08 22:07:55,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:55,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:55,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:07:55,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:55,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1443693629, now seen corresponding path program 1 times [2025-03-08 22:07:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:55,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227570462] [2025-03-08 22:07:55,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:55,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:55,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:07:55,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:07:55,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:55,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:55,217 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-08 22:07:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:55,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227570462] [2025-03-08 22:07:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227570462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:55,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:55,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:55,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306616538] [2025-03-08 22:07:55,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:55,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:55,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:55,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:55,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:55,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-08 22:07:55,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:55,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:55,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-08 22:07:55,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,295 INFO L124 PetriNetUnfolderBase]: 28/674 cut-off events. [2025-03-08 22:07:55,295 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:07:55,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 674 events. 28/674 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2251 event pairs, 15 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 707. Up to 40 conditions per place. [2025-03-08 22:07:55,299 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2025-03-08 22:07:55,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 446 transitions, 967 flow [2025-03-08 22:07:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-03-08 22:07:55,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-03-08 22:07:55,302 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 941 flow. Second operand 3 states and 1440 transitions. [2025-03-08 22:07:55,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 446 transitions, 967 flow [2025-03-08 22:07:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 446 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:07:55,307 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 903 flow [2025-03-08 22:07:55,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2025-03-08 22:07:55,308 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -28 predicate places. [2025-03-08 22:07:55,308 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 903 flow [2025-03-08 22:07:55,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:55,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:55,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:55,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:07:55,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:55,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1883668687, now seen corresponding path program 1 times [2025-03-08 22:07:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478125555] [2025-03-08 22:07:55,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:55,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 22:07:55,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 22:07:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:55,346 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-08 22:07:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478125555] [2025-03-08 22:07:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478125555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:55,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36217083] [2025-03-08 22:07:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:55,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:55,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:55,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-08 22:07:55,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:55,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:55,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-08 22:07:55,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,493 INFO L124 PetriNetUnfolderBase]: 28/673 cut-off events. [2025-03-08 22:07:55,493 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:07:55,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 673 events. 28/673 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2228 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 688. Up to 40 conditions per place. [2025-03-08 22:07:55,501 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2025-03-08 22:07:55,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 929 flow [2025-03-08 22:07:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-03-08 22:07:55,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-03-08 22:07:55,504 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 903 flow. Second operand 3 states and 1440 transitions. [2025-03-08 22:07:55,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 929 flow [2025-03-08 22:07:55,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 445 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:55,514 INFO L231 Difference]: Finished difference. Result has 443 places, 445 transitions, 901 flow [2025-03-08 22:07:55,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=443, PETRI_TRANSITIONS=445} [2025-03-08 22:07:55,515 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -29 predicate places. [2025-03-08 22:07:55,515 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 445 transitions, 901 flow [2025-03-08 22:07:55,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:55,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:55,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:55,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:07:55,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1154765826, now seen corresponding path program 1 times [2025-03-08 22:07:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161979301] [2025-03-08 22:07:55,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 22:07:55,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 22:07:55,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:55,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:55,583 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-08 22:07:55,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:55,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161979301] [2025-03-08 22:07:55,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161979301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:55,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:55,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708881462] [2025-03-08 22:07:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:55,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:55,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:55,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:55,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 506 [2025-03-08 22:07:55,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-08 22:07:55,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:55,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 506 [2025-03-08 22:07:55,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,657 INFO L124 PetriNetUnfolderBase]: 13/551 cut-off events. [2025-03-08 22:07:55,657 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:07:55,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 551 events. 13/551 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1304 event pairs, 2 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 540. Up to 16 conditions per place. [2025-03-08 22:07:55,660 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 11 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-03-08 22:07:55,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 444 transitions, 925 flow [2025-03-08 22:07:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1442 transitions. [2025-03-08 22:07:55,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9499341238471674 [2025-03-08 22:07:55,662 INFO L175 Difference]: Start difference. First operand has 443 places, 445 transitions, 901 flow. Second operand 3 states and 1442 transitions. [2025-03-08 22:07:55,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 444 transitions, 925 flow [2025-03-08 22:07:55,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 444 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:55,672 INFO L231 Difference]: Finished difference. Result has 442 places, 444 transitions, 899 flow [2025-03-08 22:07:55,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=442, PETRI_TRANSITIONS=444} [2025-03-08 22:07:55,673 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -30 predicate places. [2025-03-08 22:07:55,673 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 444 transitions, 899 flow [2025-03-08 22:07:55,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-08 22:07:55,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:55,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:07:55,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:07:55,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:55,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 129295967, now seen corresponding path program 1 times [2025-03-08 22:07:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:55,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365388898] [2025-03-08 22:07:55,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:55,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 22:07:55,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:07:55,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:55,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:55,782 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-08 22:07:55,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:55,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365388898] [2025-03-08 22:07:55,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365388898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:55,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266096918] [2025-03-08 22:07:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:55,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:55,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:55,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:55,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-08 22:07:55,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:55,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:55,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-08 22:07:55,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:55,886 INFO L124 PetriNetUnfolderBase]: 17/506 cut-off events. [2025-03-08 22:07:55,890 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:07:55,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 506 events. 17/506 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1061 event pairs, 7 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 504. Up to 26 conditions per place. [2025-03-08 22:07:55,898 INFO L140 encePairwiseOnDemand]: 503/506 looper letters, 12 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-08 22:07:55,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 443 transitions, 925 flow [2025-03-08 22:07:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2025-03-08 22:07:55,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486166007905138 [2025-03-08 22:07:55,901 INFO L175 Difference]: Start difference. First operand has 442 places, 444 transitions, 899 flow. Second operand 3 states and 1440 transitions. [2025-03-08 22:07:55,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 443 transitions, 925 flow [2025-03-08 22:07:55,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 443 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:55,910 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 897 flow [2025-03-08 22:07:55,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2025-03-08 22:07:55,915 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2025-03-08 22:07:55,915 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 897 flow [2025-03-08 22:07:55,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:55,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:55,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:07:55,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:55,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1110081293, now seen corresponding path program 1 times [2025-03-08 22:07:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:55,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798581180] [2025-03-08 22:07:55,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 22:07:55,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 22:07:55,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:55,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:07:56,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798581180] [2025-03-08 22:07:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798581180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:56,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:56,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160138742] [2025-03-08 22:07:56,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:56,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:56,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:56,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:56,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:56,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 506 [2025-03-08 22:07:56,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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-08 22:07:56,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:56,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 506 [2025-03-08 22:07:56,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:56,127 INFO L124 PetriNetUnfolderBase]: 41/877 cut-off events. [2025-03-08 22:07:56,128 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 22:07:56,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 877 events. 41/877 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3808 event pairs, 20 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 906. Up to 56 conditions per place. [2025-03-08 22:07:56,133 INFO L140 encePairwiseOnDemand]: 501/506 looper letters, 14 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2025-03-08 22:07:56,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 439 transitions, 919 flow [2025-03-08 22:07:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-03-08 22:07:56,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453227931488801 [2025-03-08 22:07:56,137 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 897 flow. Second operand 3 states and 1435 transitions. [2025-03-08 22:07:56,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 439 transitions, 919 flow [2025-03-08 22:07:56,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 439 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:07:56,142 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 887 flow [2025-03-08 22:07:56,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-08 22:07:56,144 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-08 22:07:56,144 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 887 flow [2025-03-08 22:07:56,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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-08 22:07:56,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:56,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:56,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:07:56,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:56,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash -108988986, now seen corresponding path program 1 times [2025-03-08 22:07:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323857741] [2025-03-08 22:07:56,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:56,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 22:07:56,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 22:07:56,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:56,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:56,211 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-08 22:07:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323857741] [2025-03-08 22:07:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323857741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664615530] [2025-03-08 22:07:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:56,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:56,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 506 [2025-03-08 22:07:56,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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-08 22:07:56,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:56,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 506 [2025-03-08 22:07:56,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:56,292 INFO L124 PetriNetUnfolderBase]: 17/558 cut-off events. [2025-03-08 22:07:56,292 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:07:56,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 558 events. 17/558 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1277 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 558. Up to 19 conditions per place. [2025-03-08 22:07:56,295 INFO L140 encePairwiseOnDemand]: 502/506 looper letters, 16 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2025-03-08 22:07:56,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 444 transitions, 938 flow [2025-03-08 22:07:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1454 transitions. [2025-03-08 22:07:56,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578392621870883 [2025-03-08 22:07:56,298 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 887 flow. Second operand 3 states and 1454 transitions. [2025-03-08 22:07:56,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 444 transitions, 938 flow [2025-03-08 22:07:56,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:07:56,306 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 896 flow [2025-03-08 22:07:56,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-08 22:07:56,307 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-08 22:07:56,307 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 896 flow [2025-03-08 22:07:56,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 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-08 22:07:56,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:56,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:56,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:07:56,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1659168601, now seen corresponding path program 1 times [2025-03-08 22:07:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:56,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962619073] [2025-03-08 22:07:56,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:56,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 22:07:56,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 22:07:56,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:56,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:56,367 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-08 22:07:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962619073] [2025-03-08 22:07:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962619073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:56,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:56,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708553828] [2025-03-08 22:07:56,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:56,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:56,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:56,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:56,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-08 22:07:56,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:56,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:56,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-08 22:07:56,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:56,600 INFO L124 PetriNetUnfolderBase]: 135/1964 cut-off events. [2025-03-08 22:07:56,600 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2025-03-08 22:07:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1964 events. 135/1964 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13268 event pairs, 36 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2150. Up to 187 conditions per place. [2025-03-08 22:07:56,613 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 18 selfloop transitions, 3 changer transitions 0/444 dead transitions. [2025-03-08 22:07:56,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 953 flow [2025-03-08 22:07:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2025-03-08 22:07:56,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2025-03-08 22:07:56,616 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 896 flow. Second operand 3 states and 1449 transitions. [2025-03-08 22:07:56,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 953 flow [2025-03-08 22:07:56,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 953 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:56,622 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 911 flow [2025-03-08 22:07:56,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=911, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-08 22:07:56,623 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-08 22:07:56,623 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 911 flow [2025-03-08 22:07:56,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-08 22:07:56,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:56,624 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:56,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:07:56,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:56,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash 174912950, now seen corresponding path program 1 times [2025-03-08 22:07:56,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:56,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884346888] [2025-03-08 22:07:56,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:56,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 22:07:56,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 22:07:56,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:56,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:56,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-08 22:07:56,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884346888] [2025-03-08 22:07:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884346888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:56,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:07:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704900895] [2025-03-08 22:07:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:07:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:07:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:07:56,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-08 22:07:56,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-08 22:07:56,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:56,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-08 22:07:56,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:56,886 INFO L124 PetriNetUnfolderBase]: 148/1733 cut-off events. [2025-03-08 22:07:56,887 INFO L125 PetriNetUnfolderBase]: For 49/53 co-relation queries the response was YES. [2025-03-08 22:07:56,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 1733 events. 148/1733 cut-off events. For 49/53 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10825 event pairs, 22 based on Foata normal form. 0/1553 useless extension candidates. Maximal degree in co-relation 1975. Up to 169 conditions per place. [2025-03-08 22:07:56,899 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 17 selfloop transitions, 3 changer transitions 0/443 dead transitions. [2025-03-08 22:07:56,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 443 transitions, 963 flow [2025-03-08 22:07:56,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:07:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:07:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1448 transitions. [2025-03-08 22:07:56,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9538866930171278 [2025-03-08 22:07:56,903 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 911 flow. Second operand 3 states and 1448 transitions. [2025-03-08 22:07:56,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 443 transitions, 963 flow [2025-03-08 22:07:56,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:56,909 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 926 flow [2025-03-08 22:07:56,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2025-03-08 22:07:56,912 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2025-03-08 22:07:56,912 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 926 flow [2025-03-08 22:07:56,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-08 22:07:56,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:56,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:56,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:07:56,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:56,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 342995370, now seen corresponding path program 1 times [2025-03-08 22:07:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723146188] [2025-03-08 22:07:56,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 22:07:56,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 22:07:56,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:56,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:57,118 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-08 22:07:57,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723146188] [2025-03-08 22:07:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723146188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:57,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:07:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931038207] [2025-03-08 22:07:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:57,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:07:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:57,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:07:57,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:07:57,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 506 [2025-03-08 22:07:57,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 926 flow. Second operand has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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-08 22:07:57,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:57,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 506 [2025-03-08 22:07:57,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:57,688 INFO L124 PetriNetUnfolderBase]: 87/1593 cut-off events. [2025-03-08 22:07:57,688 INFO L125 PetriNetUnfolderBase]: For 11/34 co-relation queries the response was YES. [2025-03-08 22:07:57,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1593 events. 87/1593 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7204 event pairs, 20 based on Foata normal form. 5/1495 useless extension candidates. Maximal degree in co-relation 1873. Up to 76 conditions per place. [2025-03-08 22:07:57,698 INFO L140 encePairwiseOnDemand]: 469/506 looper letters, 49 selfloop transitions, 56 changer transitions 0/496 dead transitions. [2025-03-08 22:07:57,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 496 transitions, 1258 flow [2025-03-08 22:07:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:07:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:07:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4536 transitions. [2025-03-08 22:07:57,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964426877470356 [2025-03-08 22:07:57,705 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 926 flow. Second operand 10 states and 4536 transitions. [2025-03-08 22:07:57,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 496 transitions, 1258 flow [2025-03-08 22:07:57,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 496 transitions, 1258 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:57,711 INFO L231 Difference]: Finished difference. Result has 450 places, 473 transitions, 1181 flow [2025-03-08 22:07:57,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1181, PETRI_PLACES=450, PETRI_TRANSITIONS=473} [2025-03-08 22:07:57,712 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2025-03-08 22:07:57,712 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 473 transitions, 1181 flow [2025-03-08 22:07:57,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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-08 22:07:57,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:57,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:07:57,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -283256422, now seen corresponding path program 1 times [2025-03-08 22:07:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114374580] [2025-03-08 22:07:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:57,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 22:07:57,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 22:07:57,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:57,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:57,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-08 22:07:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114374580] [2025-03-08 22:07:57,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114374580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:57,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815705686] [2025-03-08 22:07:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:57,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:07:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:57,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:07:57,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:07:57,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 506 [2025-03-08 22:07:57,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 473 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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-08 22:07:57,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:57,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 506 [2025-03-08 22:07:57,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:07:58,162 INFO L124 PetriNetUnfolderBase]: 153/2461 cut-off events. [2025-03-08 22:07:58,162 INFO L125 PetriNetUnfolderBase]: For 78/123 co-relation queries the response was YES. [2025-03-08 22:07:58,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 2461 events. 153/2461 cut-off events. For 78/123 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 14974 event pairs, 45 based on Foata normal form. 10/2292 useless extension candidates. Maximal degree in co-relation 2965. Up to 121 conditions per place. [2025-03-08 22:07:58,179 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 24 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-03-08 22:07:58,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 484 transitions, 1269 flow [2025-03-08 22:07:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:07:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 22:07:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2390 transitions. [2025-03-08 22:07:58,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446640316205533 [2025-03-08 22:07:58,183 INFO L175 Difference]: Start difference. First operand has 450 places, 473 transitions, 1181 flow. Second operand 5 states and 2390 transitions. [2025-03-08 22:07:58,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 484 transitions, 1269 flow [2025-03-08 22:07:58,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 484 transitions, 1269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:07:58,192 INFO L231 Difference]: Finished difference. Result has 456 places, 475 transitions, 1206 flow [2025-03-08 22:07:58,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1206, PETRI_PLACES=456, PETRI_TRANSITIONS=475} [2025-03-08 22:07:58,194 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2025-03-08 22:07:58,194 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 475 transitions, 1206 flow [2025-03-08 22:07:58,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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-08 22:07:58,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:07:58,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:07:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:07:58,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:07:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:07:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1045986885, now seen corresponding path program 1 times [2025-03-08 22:07:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:07:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058974886] [2025-03-08 22:07:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:07:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:07:58,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 22:07:58,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 22:07:58,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:07:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:07:58,653 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-08 22:07:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:07:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058974886] [2025-03-08 22:07:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058974886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:07:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:07:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:07:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893489591] [2025-03-08 22:07:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:07:58,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:07:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:07:58,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:07:58,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:07:59,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-08 22:07:59,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 475 transitions, 1206 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-08 22:07:59,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:07:59,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-08 22:07:59,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:00,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1124] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][364], [504#(= |#race~N~0| 0), 463#L67-24true, 247#L51-24true, Black: 543#(<= ~N~0 0), 559#true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, 536#(= |#race~C2~0| 0), 136#L62true, Black: 526#true, 525#(= |#race~M~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 530#true, Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), Black: 534#true, 532#(= |#race~A~0| 0), 566#true]) [2025-03-08 22:08:00,643 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-08 22:08:00,644 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:00,644 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:00,644 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-08 22:08:00,985 INFO L124 PetriNetUnfolderBase]: 2248/13787 cut-off events. [2025-03-08 22:08:00,985 INFO L125 PetriNetUnfolderBase]: For 873/909 co-relation queries the response was YES. [2025-03-08 22:08:01,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18861 conditions, 13787 events. 2248/13787 cut-off events. For 873/909 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 151945 event pairs, 1160 based on Foata normal form. 0/12400 useless extension candidates. Maximal degree in co-relation 18809. Up to 3033 conditions per place. [2025-03-08 22:08:01,077 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 54 selfloop transitions, 38 changer transitions 0/520 dead transitions. [2025-03-08 22:08:01,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 520 transitions, 1488 flow [2025-03-08 22:08:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-08 22:08:01,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-08 22:08:01,082 INFO L175 Difference]: Start difference. First operand has 456 places, 475 transitions, 1206 flow. Second operand 6 states and 2767 transitions. [2025-03-08 22:08:01,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 520 transitions, 1488 flow [2025-03-08 22:08:01,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 520 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:01,096 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1455 flow [2025-03-08 22:08:01,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1455, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2025-03-08 22:08:01,097 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2025-03-08 22:08:01,097 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1455 flow [2025-03-08 22:08:01,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-08 22:08:01,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:01,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:08:01,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:08:01,098 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:08:01,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash -171015524, now seen corresponding path program 1 times [2025-03-08 22:08:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605147998] [2025-03-08 22:08:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:01,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 22:08:01,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 22:08:01,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:01,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:01,161 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-08 22:08:01,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605147998] [2025-03-08 22:08:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605147998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:01,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90752128] [2025-03-08 22:08:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:01,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:01,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:01,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:01,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 506 [2025-03-08 22:08:01,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-08 22:08:01,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:01,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 506 [2025-03-08 22:08:01,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:02,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1124] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][356], [579#(= |#race~B~0| 0), 247#L51-24true, 94#L59-25true, Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), 463#L67-24true, Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-08 22:08:02,472 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-08 22:08:02,472 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-08 22:08:02,472 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:02,472 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:02,743 INFO L124 PetriNetUnfolderBase]: 1600/11576 cut-off events. [2025-03-08 22:08:02,743 INFO L125 PetriNetUnfolderBase]: For 741/958 co-relation queries the response was YES. [2025-03-08 22:08:02,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16517 conditions, 11576 events. 1600/11576 cut-off events. For 741/958 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 123005 event pairs, 343 based on Foata normal form. 0/10650 useless extension candidates. Maximal degree in co-relation 16462. Up to 1365 conditions per place. [2025-03-08 22:08:02,815 INFO L140 encePairwiseOnDemand]: 500/506 looper letters, 18 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2025-03-08 22:08:02,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 517 transitions, 1512 flow [2025-03-08 22:08:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:02,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2025-03-08 22:08:02,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2025-03-08 22:08:02,817 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1455 flow. Second operand 3 states and 1449 transitions. [2025-03-08 22:08:02,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 517 transitions, 1512 flow [2025-03-08 22:08:02,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 517 transitions, 1512 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:02,829 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1470 flow [2025-03-08 22:08:02,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2025-03-08 22:08:02,830 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2025-03-08 22:08:02,830 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1470 flow [2025-03-08 22:08:02,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-08 22:08:02,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:02,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:02,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:08:02,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:08:02,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:02,832 INFO L85 PathProgramCache]: Analyzing trace with hash -728337259, now seen corresponding path program 1 times [2025-03-08 22:08:02,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:02,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736084595] [2025-03-08 22:08:02,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:02,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 22:08:02,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 22:08:02,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:02,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:03,294 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-08 22:08:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736084595] [2025-03-08 22:08:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736084595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:03,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286548304] [2025-03-08 22:08:03,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:03,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:03,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:03,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:03,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-08 22:08:03,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1470 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-08 22:08:03,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:03,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-08 22:08:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:06,910 INFO L124 PetriNetUnfolderBase]: 4627/22163 cut-off events. [2025-03-08 22:08:06,911 INFO L125 PetriNetUnfolderBase]: For 5445/8002 co-relation queries the response was YES. [2025-03-08 22:08:06,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36861 conditions, 22163 events. 4627/22163 cut-off events. For 5445/8002 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 267222 event pairs, 1255 based on Foata normal form. 57/20417 useless extension candidates. Maximal degree in co-relation 36804. Up to 5415 conditions per place. [2025-03-08 22:08:07,048 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 85 selfloop transitions, 110 changer transitions 0/629 dead transitions. [2025-03-08 22:08:07,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 629 transitions, 2432 flow [2025-03-08 22:08:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-08 22:08:07,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-08 22:08:07,052 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1470 flow. Second operand 6 states and 2767 transitions. [2025-03-08 22:08:07,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 629 transitions, 2432 flow [2025-03-08 22:08:07,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 629 transitions, 2432 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:07,072 INFO L231 Difference]: Finished difference. Result has 474 places, 621 transitions, 2528 flow [2025-03-08 22:08:07,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2528, PETRI_PLACES=474, PETRI_TRANSITIONS=621} [2025-03-08 22:08:07,073 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 2 predicate places. [2025-03-08 22:08:07,073 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 621 transitions, 2528 flow [2025-03-08 22:08:07,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-08 22:08:07,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:07,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:08:07,074 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:08:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1338946975, now seen corresponding path program 1 times [2025-03-08 22:08:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426816521] [2025-03-08 22:08:07,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:07,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 22:08:07,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 22:08:07,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:07,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:07,422 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-08 22:08:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426816521] [2025-03-08 22:08:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426816521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:07,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007049380] [2025-03-08 22:08:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:07,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:07,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:07,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-08 22:08:07,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 621 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-08 22:08:07,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:07,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-08 22:08:07,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:11,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1124] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][355], [579#(= |#race~B~0| 0), 247#L51-24true, 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), 463#L67-24true, Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, 536#(= |#race~C2~0| 0), 136#L62true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-08 22:08:11,520 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-08 22:08:11,520 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:11,520 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-08 22:08:11,520 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:12,356 INFO L124 PetriNetUnfolderBase]: 6954/31115 cut-off events. [2025-03-08 22:08:12,356 INFO L125 PetriNetUnfolderBase]: For 23430/33938 co-relation queries the response was YES. [2025-03-08 22:08:12,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61286 conditions, 31115 events. 6954/31115 cut-off events. For 23430/33938 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 395187 event pairs, 1661 based on Foata normal form. 203/29015 useless extension candidates. Maximal degree in co-relation 61224. Up to 7756 conditions per place. [2025-03-08 22:08:12,658 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 187 selfloop transitions, 215 changer transitions 0/838 dead transitions. [2025-03-08 22:08:12,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 838 transitions, 5026 flow [2025-03-08 22:08:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:12,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-08 22:08:12,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-08 22:08:12,662 INFO L175 Difference]: Start difference. First operand has 474 places, 621 transitions, 2528 flow. Second operand 6 states and 2767 transitions. [2025-03-08 22:08:12,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 838 transitions, 5026 flow [2025-03-08 22:08:12,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 838 transitions, 5026 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:12,711 INFO L231 Difference]: Finished difference. Result has 484 places, 830 transitions, 5178 flow [2025-03-08 22:08:12,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5178, PETRI_PLACES=484, PETRI_TRANSITIONS=830} [2025-03-08 22:08:12,712 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 12 predicate places. [2025-03-08 22:08:12,712 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 830 transitions, 5178 flow [2025-03-08 22:08:12,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-08 22:08:12,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:12,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:08:12,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:08:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash 496613369, now seen corresponding path program 1 times [2025-03-08 22:08:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409075627] [2025-03-08 22:08:12,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:12,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 22:08:12,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 22:08:12,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:13,319 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-08 22:08:13,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409075627] [2025-03-08 22:08:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409075627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:13,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560976717] [2025-03-08 22:08:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:13,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:13,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:13,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:14,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 506 [2025-03-08 22:08:14,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 830 transitions, 5178 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-08 22:08:14,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:14,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 506 [2025-03-08 22:08:14,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:20,308 INFO L124 PetriNetUnfolderBase]: 10076/38698 cut-off events. [2025-03-08 22:08:20,309 INFO L125 PetriNetUnfolderBase]: For 71824/80563 co-relation queries the response was YES. [2025-03-08 22:08:20,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93348 conditions, 38698 events. 10076/38698 cut-off events. For 71824/80563 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 497489 event pairs, 1689 based on Foata normal form. 670/36722 useless extension candidates. Maximal degree in co-relation 93281. Up to 11029 conditions per place. [2025-03-08 22:08:20,804 INFO L140 encePairwiseOnDemand]: 491/506 looper letters, 382 selfloop transitions, 495 changer transitions 0/1319 dead transitions. [2025-03-08 22:08:20,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1319 transitions, 12054 flow [2025-03-08 22:08:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2025-03-08 22:08:20,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9113965744400527 [2025-03-08 22:08:20,808 INFO L175 Difference]: Start difference. First operand has 484 places, 830 transitions, 5178 flow. Second operand 6 states and 2767 transitions. [2025-03-08 22:08:20,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1319 transitions, 12054 flow [2025-03-08 22:08:20,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1319 transitions, 12054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:20,947 INFO L231 Difference]: Finished difference. Result has 494 places, 1311 transitions, 12524 flow [2025-03-08 22:08:20,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=5178, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12524, PETRI_PLACES=494, PETRI_TRANSITIONS=1311} [2025-03-08 22:08:20,948 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 22 predicate places. [2025-03-08 22:08:20,948 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1311 transitions, 12524 flow [2025-03-08 22:08:20,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-08 22:08:20,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:20,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:20,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:08:20,949 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:08:20,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1572901013, now seen corresponding path program 1 times [2025-03-08 22:08:20,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:20,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15911962] [2025-03-08 22:08:20,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:20,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 22:08:20,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 22:08:20,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:20,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:21,356 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-08 22:08:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15911962] [2025-03-08 22:08:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15911962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:21,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147865659] [2025-03-08 22:08:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:21,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:21,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:21,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:21,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 506 [2025-03-08 22:08:21,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1311 transitions, 12524 flow. Second operand has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 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-08 22:08:21,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:21,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 506 [2025-03-08 22:08:21,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:36,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1124] L67-26-->L67-24: Formula: (= |v_#race~A~0_9| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_9|} AuxVars[] AssignedVars[#race~A~0][353], [579#(= |#race~B~0| 0), 247#L51-24true, 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 463#L67-24true, Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, 536#(= |#race~C2~0| 0), 136#L62true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-08 22:08:36,153 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-08 22:08:36,153 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-08 22:08:36,153 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:36,154 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-08 22:08:41,610 INFO L124 PetriNetUnfolderBase]: 40929/100034 cut-off events. [2025-03-08 22:08:41,611 INFO L125 PetriNetUnfolderBase]: For 188572/192379 co-relation queries the response was YES. [2025-03-08 22:08:42,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281372 conditions, 100034 events. 40929/100034 cut-off events. For 188572/192379 co-relation queries the response was YES. Maximal size of possible extension queue 2200. Compared 1216528 event pairs, 16417 based on Foata normal form. 702/93537 useless extension candidates. Maximal degree in co-relation 281300. Up to 57622 conditions per place. [2025-03-08 22:08:42,965 INFO L140 encePairwiseOnDemand]: 475/506 looper letters, 890 selfloop transitions, 229 changer transitions 0/1521 dead transitions. [2025-03-08 22:08:42,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1521 transitions, 16342 flow [2025-03-08 22:08:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2693 transitions. [2025-03-08 22:08:42,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870223978919631 [2025-03-08 22:08:42,969 INFO L175 Difference]: Start difference. First operand has 494 places, 1311 transitions, 12524 flow. Second operand 6 states and 2693 transitions. [2025-03-08 22:08:42,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 1521 transitions, 16342 flow [2025-03-08 22:08:43,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 1521 transitions, 16342 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:43,947 INFO L231 Difference]: Finished difference. Result has 503 places, 1502 transitions, 14919 flow [2025-03-08 22:08:43,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=506, PETRI_DIFFERENCE_MINUEND_FLOW=12524, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14919, PETRI_PLACES=503, PETRI_TRANSITIONS=1502} [2025-03-08 22:08:43,949 INFO L279 CegarLoopForPetriNet]: 472 programPoint places, 31 predicate places. [2025-03-08 22:08:43,949 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 1502 transitions, 14919 flow [2025-03-08 22:08:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 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-08 22:08:43,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:43,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:43,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:08:43,950 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2025-03-08 22:08:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:43,951 INFO L85 PathProgramCache]: Analyzing trace with hash -178025244, now seen corresponding path program 1 times [2025-03-08 22:08:43,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:43,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905654251] [2025-03-08 22:08:43,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:43,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 22:08:43,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 22:08:43,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:43,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905654251] [2025-03-08 22:08:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905654251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:44,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328779946] [2025-03-08 22:08:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:44,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:44,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:44,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:44,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:44,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 506 [2025-03-08 22:08:44,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1502 transitions, 14919 flow. Second operand has 6 states, 6 states have (on average 419.3333333333333) internal successors, (2516), 6 states have internal predecessors, (2516), 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-08 22:08:44,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:44,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 506 [2025-03-08 22:08:44,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:45,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1134] L67-18-->L67-16: Formula: (= |v_#race~B~0_9| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_9|} AuxVars[] AssignedVars[#race~B~0][399], [Black: 566#true, 579#(= |#race~B~0| 0), 543#(<= ~N~0 0), Black: 577#true, 592#true, 218#L59-16true, 624#true, Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), Black: 530#true, 603#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), 430#thread1ENTRYtrue, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 536#(= |#race~C2~0| 0), 526#true, 461#L67-16true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)]) [2025-03-08 22:08:45,749 INFO L294 olderBase$Statistics]: this new event has 269 ancestors and is cut-off event [2025-03-08 22:08:45,749 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:08:45,749 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2025-03-08 22:08:45,749 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-08 22:08:46,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L67-22-->L67-21: Formula: (= (store |v_#race_90| v_~A~0.base_21 (store (select |v_#race_90| v_~A~0.base_21) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_21) 0)) |v_#race_89|) InVars {#race=|v_#race_90|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21} OutVars{#race=|v_#race_89|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21} AuxVars[] AssignedVars[#race][409], [579#(= |#race~B~0| 0), 543#(<= ~N~0 0), 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 577#true, 592#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), 194#L59-3true, 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), 430#thread1ENTRYtrue, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, 446#L67-21true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-08 22:08:46,154 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2025-03-08 22:08:46,154 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-08 22:08:46,154 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-08 22:08:46,154 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2025-03-08 22:08:46,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1134] L67-18-->L67-16: Formula: (= |v_#race~B~0_9| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_9|} AuxVars[] AssignedVars[#race~B~0][399], [Black: 566#true, 579#(= |#race~B~0| 0), 543#(<= ~N~0 0), Black: 577#true, 592#true, 218#L59-16true, Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), Black: 530#true, 603#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 536#(= |#race~C2~0| 0), 526#true, 461#L67-16true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 532#(= |#race~A~0| 0), 129#L91true, Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)]) [2025-03-08 22:08:46,223 INFO L294 olderBase$Statistics]: this new event has 280 ancestors and is cut-off event [2025-03-08 22:08:46,223 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-08 22:08:46,223 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-08 22:08:46,223 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-08 22:08:46,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L67-22-->L67-21: Formula: (= (store |v_#race_90| v_~A~0.base_21 (store (select |v_#race_90| v_~A~0.base_21) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_21) 0)) |v_#race_89|) InVars {#race=|v_#race_90|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21} OutVars{#race=|v_#race_89|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21} AuxVars[] AssignedVars[#race][409], [579#(= |#race~B~0| 0), 543#(<= ~N~0 0), 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), 194#L59-3true, 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, 446#L67-21true, 614#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 532#(= |#race~A~0| 0), 129#L91true, Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-08 22:08:46,752 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-08 22:08:46,752 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-08 22:08:46,752 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2025-03-08 22:08:46,752 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-08 22:08:54,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1134] L67-18-->L67-16: Formula: (= |v_#race~B~0_9| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_9|} AuxVars[] AssignedVars[#race~B~0][399], [Black: 566#true, 579#(= |#race~B~0| 0), 592#true, Black: 577#true, Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 218#L59-16true, 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), Black: 530#true, 603#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, 430#thread1ENTRYtrue, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 614#true, 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 150#L89-1true, Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 526#true, 461#L67-16true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)]) [2025-03-08 22:08:54,762 INFO L294 olderBase$Statistics]: this new event has 325 ancestors and is cut-off event [2025-03-08 22:08:54,762 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-03-08 22:08:54,762 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-08 22:08:54,762 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2025-03-08 22:08:59,712 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1128] L67-22-->L67-21: Formula: (= (store |v_#race_90| v_~A~0.base_21 (store (select |v_#race_90| v_~A~0.base_21) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_11) v_~A~0.offset_21) 0)) |v_#race_89|) InVars {#race=|v_#race_90|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21} OutVars{#race=|v_#race_89|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_11, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21} AuxVars[] AssignedVars[#race][409], [579#(= |#race~B~0| 0), 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), 592#true, Black: 577#true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 624#true, Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 194#L59-3true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, 430#thread1ENTRYtrue, Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 566#true, 446#L67-21true, 614#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 150#L89-1true, Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 526#true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 538#true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0))]) [2025-03-08 22:08:59,712 INFO L294 olderBase$Statistics]: this new event has 334 ancestors and is cut-off event [2025-03-08 22:08:59,712 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2025-03-08 22:08:59,712 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2025-03-08 22:08:59,712 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-03-08 22:09:00,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1134] L67-18-->L67-16: Formula: (= |v_#race~B~0_9| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_9|} AuxVars[] AssignedVars[#race~B~0][399], [Black: 566#true, 579#(= |#race~B~0| 0), 592#true, Black: 577#true, 218#L59-16true, 624#true, Black: 583#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 581#true, 525#(= |#race~M~0| 0), 603#true, Black: 530#true, Black: 597#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 595#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 534#true, Black: 596#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0)), Black: 594#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0), 614#true, Black: 608#(and (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), 504#(= |#race~N~0| 0), Black: 606#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 605#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0), Black: 607#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0)), Black: 543#(<= ~N~0 0), Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 617#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)))), Black: 616#(= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 619#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 3 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 618#(and (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4)))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1))) (= |thread2Thread1of1ForFork1_#t~nondet7| (select (select |#race| ~C2~0.base) (+ 2 ~C2~0.offset (* thread2Thread1of1ForFork1_~i~1 4))))), 536#(= |#race~C2~0| 0), 586#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread3Thread1of1ForFork0_~i~2 4))) 0)), 526#true, 461#L67-16true, Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork1_~i~1 0)), 571#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), 538#true, 129#L91true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4) 1)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)), Black: 568#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread2Thread1of1ForFork1_~i~1 4))) 0)]) [2025-03-08 22:09:00,421 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-08 22:09:00,421 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-08 22:09:00,421 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-03-08 22:09:00,421 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event