./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:47:48,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:47:48,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:47:48,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:47:48,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:47:48,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:47:48,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:47:48,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:47:48,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:47:48,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:47:48,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:47:48,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:47:48,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:47:48,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:47:48,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:47:48,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:47:48,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:47:48,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:47:48,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:47:48,217 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 -> 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 [2025-03-14 01:47:48,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:47:48,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:47:48,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:47:48,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:47:48,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:47:48,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2025-03-14 01:47:49,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6886e4fb1/5f40e69416e04687aba299c4f0e6ef62/FLAGc878c9773 [2025-03-14 01:47:49,880 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:47:49,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2025-03-14 01:47:49,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6886e4fb1/5f40e69416e04687aba299c4f0e6ef62/FLAGc878c9773 [2025-03-14 01:47:50,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6886e4fb1/5f40e69416e04687aba299c4f0e6ef62 [2025-03-14 01:47:50,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:47:50,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:47:50,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:47:50,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:47:50,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:47:50,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c9f299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50, skipping insertion in model container [2025-03-14 01:47:50,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:47:50,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:47:50,448 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:47:50,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:47:50,528 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:47:50,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50 WrapperNode [2025-03-14 01:47:50,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:47:50,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:47:50,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:47:50,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:47:50,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,561 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-14 01:47:50,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:47:50,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:47:50,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:47:50,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:47:50,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:47:50,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:47:50,578 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:47:50,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:47:50,579 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (1/1) ... [2025-03-14 01:47:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:47:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:47:50,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:47:50,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:47:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:47:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:47:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:47:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:47:50,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-14 01:47:50,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-14 01:47:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:47:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:47:50,632 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:47:50,734 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:47:50,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:47:50,934 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:47:50,936 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:47:50,936 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:47:50,943 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:47:50,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:47:50 BoogieIcfgContainer [2025-03-14 01:47:50,944 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:47:50,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:47:50,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:47:50,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:47:50,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:47:50" (1/3) ... [2025-03-14 01:47:50,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48734582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:47:50, skipping insertion in model container [2025-03-14 01:47:50,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:47:50" (2/3) ... [2025-03-14 01:47:50,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48734582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:47:50, skipping insertion in model container [2025-03-14 01:47:50,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:47:50" (3/3) ... [2025-03-14 01:47:50,950 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2025-03-14 01:47:50,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:47:50,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-14 01:47:50,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:47:51,012 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:47:51,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 195 flow [2025-03-14 01:47:51,088 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-03-14 01:47:51,089 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:47:51,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 230 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-03-14 01:47:51,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 94 transitions, 195 flow [2025-03-14 01:47:51,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 94 transitions, 195 flow [2025-03-14 01:47:51,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:47:51,114 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;@29e94211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:47:51,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-14 01:47:51,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:47:51,124 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-14 01:47:51,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:47:51,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:51,125 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-14 01:47:51,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:51,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1488212005, now seen corresponding path program 1 times [2025-03-14 01:47:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990389873] [2025-03-14 01:47:51,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:51,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:51,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:47:51,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:47:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:51,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990389873] [2025-03-14 01:47:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990389873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:51,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:51,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982492945] [2025-03-14 01:47:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:51,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:51,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2025-03-14 01:47:51,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:51,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:51,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2025-03-14 01:47:51,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:51,419 INFO L124 PetriNetUnfolderBase]: 3/161 cut-off events. [2025-03-14 01:47:51,423 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:47:51,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 161 events. 3/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 2 based on Foata normal form. 1/143 useless extension candidates. Maximal degree in co-relation 101. Up to 15 conditions per place. [2025-03-14 01:47:51,425 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-03-14 01:47:51,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2025-03-14 01:47:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-03-14 01:47:51,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-03-14 01:47:51,439 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 195 flow. Second operand 3 states and 258 transitions. [2025-03-14 01:47:51,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2025-03-14 01:47:51,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:51,448 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2025-03-14 01:47:51,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-03-14 01:47:51,453 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-14 01:47:51,453 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2025-03-14 01:47:51,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:51,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:51,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:47:51,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash -138830217, now seen corresponding path program 1 times [2025-03-14 01:47:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931628108] [2025-03-14 01:47:51,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:51,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:47:51,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:47:51,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:51,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:51,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:51,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931628108] [2025-03-14 01:47:51,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931628108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:51,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:51,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:51,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079409620] [2025-03-14 01:47:51,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:51,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:51,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:51,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:51,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:51,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2025-03-14 01:47:51,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:51,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:51,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2025-03-14 01:47:51,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:51,593 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-03-14 01:47:51,593 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:47:51,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 169 events. 5/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 335 event pairs, 2 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2025-03-14 01:47:51,595 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-14 01:47:51,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2025-03-14 01:47:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-03-14 01:47:51,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2025-03-14 01:47:51,598 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2025-03-14 01:47:51,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2025-03-14 01:47:51,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:47:51,602 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2025-03-14 01:47:51,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2025-03-14 01:47:51,602 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-03-14 01:47:51,602 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2025-03-14 01:47:51,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:51,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:51,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:51,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:47:51,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:51,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash -292529000, now seen corresponding path program 1 times [2025-03-14 01:47:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:51,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577093167] [2025-03-14 01:47:51,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:51,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:47:51,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:47:51,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:51,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577093167] [2025-03-14 01:47:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577093167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:52,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:52,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894518687] [2025-03-14 01:47:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:52,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:52,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:52,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 94 [2025-03-14 01:47:52,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:52,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:52,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 94 [2025-03-14 01:47:52,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:52,272 INFO L124 PetriNetUnfolderBase]: 73/402 cut-off events. [2025-03-14 01:47:52,272 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:47:52,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 402 events. 73/402 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1943 event pairs, 35 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 501. Up to 159 conditions per place. [2025-03-14 01:47:52,276 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2025-03-14 01:47:52,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 331 flow [2025-03-14 01:47:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2025-03-14 01:47:52,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156028368794326 [2025-03-14 01:47:52,280 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 460 transitions. [2025-03-14 01:47:52,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 331 flow [2025-03-14 01:47:52,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:52,283 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 349 flow [2025-03-14 01:47:52,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2025-03-14 01:47:52,285 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2025-03-14 01:47:52,285 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 349 flow [2025-03-14 01:47:52,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:52,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:52,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:52,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:47:52,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:52,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:52,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1340521526, now seen corresponding path program 1 times [2025-03-14 01:47:52,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:52,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197819472] [2025-03-14 01:47:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:47:52,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:47:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:52,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:52,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:52,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197819472] [2025-03-14 01:47:52,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197819472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:52,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:52,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156831084] [2025-03-14 01:47:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:52,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:47:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:52,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:47:52,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:47:52,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-03-14 01:47:52,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:52,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:52,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-03-14 01:47:52,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:52,493 INFO L124 PetriNetUnfolderBase]: 34/262 cut-off events. [2025-03-14 01:47:52,494 INFO L125 PetriNetUnfolderBase]: For 37/45 co-relation queries the response was YES. [2025-03-14 01:47:52,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 262 events. 34/262 cut-off events. For 37/45 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 940 event pairs, 0 based on Foata normal form. 2/254 useless extension candidates. Maximal degree in co-relation 335. Up to 49 conditions per place. [2025-03-14 01:47:52,497 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 11 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2025-03-14 01:47:52,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 395 flow [2025-03-14 01:47:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2025-03-14 01:47:52,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8847517730496454 [2025-03-14 01:47:52,500 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 349 flow. Second operand 6 states and 499 transitions. [2025-03-14 01:47:52,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 395 flow [2025-03-14 01:47:52,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:52,504 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 367 flow [2025-03-14 01:47:52,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2025-03-14 01:47:52,505 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2025-03-14 01:47:52,505 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 367 flow [2025-03-14 01:47:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:52,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:52,505 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] [2025-03-14 01:47:52,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:47:52,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:52,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:52,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1115899733, now seen corresponding path program 1 times [2025-03-14 01:47:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:52,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922700789] [2025-03-14 01:47:52,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:52,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:52,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:47:52,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:47:52,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:52,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:52,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922700789] [2025-03-14 01:47:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922700789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360898] [2025-03-14 01:47:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:52,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:52,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:52,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:52,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2025-03-14 01:47:52,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:52,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:52,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2025-03-14 01:47:52,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:53,036 INFO L124 PetriNetUnfolderBase]: 131/506 cut-off events. [2025-03-14 01:47:53,037 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2025-03-14 01:47:53,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 506 events. 131/506 cut-off events. For 135/137 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2612 event pairs, 23 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 1034. Up to 240 conditions per place. [2025-03-14 01:47:53,041 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2025-03-14 01:47:53,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 689 flow [2025-03-14 01:47:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2025-03-14 01:47:53,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705673758865248 [2025-03-14 01:47:53,043 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 367 flow. Second operand 6 states and 491 transitions. [2025-03-14 01:47:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 689 flow [2025-03-14 01:47:53,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-14 01:47:53,051 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2025-03-14 01:47:53,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2025-03-14 01:47:53,053 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2025-03-14 01:47:53,054 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2025-03-14 01:47:53,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:53,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:53,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:47:53,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -275567546, now seen corresponding path program 1 times [2025-03-14 01:47:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:53,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178149633] [2025-03-14 01:47:53,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:53,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:53,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:47:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:47:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178149633] [2025-03-14 01:47:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178149633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:53,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:53,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067688206] [2025-03-14 01:47:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:53,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:53,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:53,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2025-03-14 01:47:53,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:53,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2025-03-14 01:47:53,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:53,562 INFO L124 PetriNetUnfolderBase]: 142/512 cut-off events. [2025-03-14 01:47:53,562 INFO L125 PetriNetUnfolderBase]: For 428/432 co-relation queries the response was YES. [2025-03-14 01:47:53,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 512 events. 142/512 cut-off events. For 428/432 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2826 event pairs, 10 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1505. Up to 241 conditions per place. [2025-03-14 01:47:53,566 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2025-03-14 01:47:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2025-03-14 01:47:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2025-03-14 01:47:53,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8315602836879432 [2025-03-14 01:47:53,569 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2025-03-14 01:47:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2025-03-14 01:47:53,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-14 01:47:53,578 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2025-03-14 01:47:53,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=114, PETRI_TRANSITIONS=158} [2025-03-14 01:47:53,580 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2025-03-14 01:47:53,581 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2025-03-14 01:47:53,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:53,581 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:53,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:47:53,582 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:47:53,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1824629221, now seen corresponding path program 1 times [2025-03-14 01:47:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319867908] [2025-03-14 01:47:53,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:53,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:47:53,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:47:53,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:53,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:47:53,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:47:53,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-14 01:47:53,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-14 01:47:53,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:53,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:47:53,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:47:53,646 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:47:53,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-14 01:47:53,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-14 01:47:53,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:47:53,649 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:53,652 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:47:53,654 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:47:53,671 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:47:53,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 246 flow [2025-03-14 01:47:53,690 INFO L124 PetriNetUnfolderBase]: 4/216 cut-off events. [2025-03-14 01:47:53,690 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:47:53,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 4/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 500 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2025-03-14 01:47:53,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 246 flow [2025-03-14 01:47:53,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 246 flow [2025-03-14 01:47:53,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:47:53,693 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;@29e94211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:47:53,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-14 01:47:53,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:47:53,695 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-14 01:47:53,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:47:53,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:53,695 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-14 01:47:53,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:53,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:53,695 INFO L85 PathProgramCache]: Analyzing trace with hash -200302984, now seen corresponding path program 1 times [2025-03-14 01:47:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:53,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875546762] [2025-03-14 01:47:53,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:53,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:53,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:47:53,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:47:53,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:53,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875546762] [2025-03-14 01:47:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875546762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:53,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323280901] [2025-03-14 01:47:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:53,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:53,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:53,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:53,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-03-14 01:47:53,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:53,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-03-14 01:47:53,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:53,776 INFO L124 PetriNetUnfolderBase]: 19/441 cut-off events. [2025-03-14 01:47:53,777 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-14 01:47:53,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 441 events. 19/441 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1868 event pairs, 16 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 287. Up to 50 conditions per place. [2025-03-14 01:47:53,780 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-03-14 01:47:53,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2025-03-14 01:47:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-03-14 01:47:53,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-14 01:47:53,781 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 246 flow. Second operand 3 states and 315 transitions. [2025-03-14 01:47:53,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2025-03-14 01:47:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:53,783 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2025-03-14 01:47:53,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2025-03-14 01:47:53,783 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2025-03-14 01:47:53,784 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2025-03-14 01:47:53,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:53,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:53,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:47:53,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1464718039, now seen corresponding path program 1 times [2025-03-14 01:47:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:53,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482646111] [2025-03-14 01:47:53,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:53,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:47:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:47:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:53,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482646111] [2025-03-14 01:47:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482646111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:53,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:53,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010746196] [2025-03-14 01:47:53,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:53,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:53,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:53,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-03-14 01:47:53,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:53,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-03-14 01:47:53,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:53,888 INFO L124 PetriNetUnfolderBase]: 48/598 cut-off events. [2025-03-14 01:47:53,888 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-14 01:47:53,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 48/598 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2964 event pairs, 27 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 692. Up to 97 conditions per place. [2025-03-14 01:47:53,891 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-03-14 01:47:53,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2025-03-14 01:47:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2025-03-14 01:47:53,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9217391304347826 [2025-03-14 01:47:53,893 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2025-03-14 01:47:53,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2025-03-14 01:47:53,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:47:53,895 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2025-03-14 01:47:53,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-03-14 01:47:53,895 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-14 01:47:53,895 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2025-03-14 01:47:53,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:53,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:53,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:53,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:47:53,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:53,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1175910568, now seen corresponding path program 1 times [2025-03-14 01:47:53,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:53,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060371635] [2025-03-14 01:47:53,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:53,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:47:53,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:47:53,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:53,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060371635] [2025-03-14 01:47:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060371635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:54,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:54,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149655375] [2025-03-14 01:47:54,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:54,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:54,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:54,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:54,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2025-03-14 01:47:54,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:54,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:54,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2025-03-14 01:47:54,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:54,517 INFO L124 PetriNetUnfolderBase]: 1014/3169 cut-off events. [2025-03-14 01:47:54,517 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-14 01:47:54,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 3169 events. 1014/3169 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26235 event pairs, 586 based on Foata normal form. 0/2847 useless extension candidates. Maximal degree in co-relation 4117. Up to 1592 conditions per place. [2025-03-14 01:47:54,540 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 30 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2025-03-14 01:47:54,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 472 flow [2025-03-14 01:47:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2025-03-14 01:47:54,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8304347826086956 [2025-03-14 01:47:54,543 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 573 transitions. [2025-03-14 01:47:54,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 472 flow [2025-03-14 01:47:54,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:54,546 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 509 flow [2025-03-14 01:47:54,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=125, PETRI_TRANSITIONS=149} [2025-03-14 01:47:54,547 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-03-14 01:47:54,547 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 509 flow [2025-03-14 01:47:54,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:54,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:54,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:54,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:47:54,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:54,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2071064202, now seen corresponding path program 1 times [2025-03-14 01:47:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:54,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348214137] [2025-03-14 01:47:54,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:54,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:47:54,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:47:54,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:54,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:54,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348214137] [2025-03-14 01:47:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348214137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:54,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:54,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555406565] [2025-03-14 01:47:54,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:54,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:47:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:54,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:47:54,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:47:54,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-03-14 01:47:54,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 149 transitions, 509 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:54,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:54,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-03-14 01:47:54,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:54,826 INFO L124 PetriNetUnfolderBase]: 484/1788 cut-off events. [2025-03-14 01:47:54,826 INFO L125 PetriNetUnfolderBase]: For 362/424 co-relation queries the response was YES. [2025-03-14 01:47:54,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1788 events. 484/1788 cut-off events. For 362/424 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12946 event pairs, 135 based on Foata normal form. 2/1689 useless extension candidates. Maximal degree in co-relation 2702. Up to 615 conditions per place. [2025-03-14 01:47:54,836 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 14 selfloop transitions, 2 changer transitions 5/155 dead transitions. [2025-03-14 01:47:54,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 563 flow [2025-03-14 01:47:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-03-14 01:47:54,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2025-03-14 01:47:54,838 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 509 flow. Second operand 6 states and 616 transitions. [2025-03-14 01:47:54,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 563 flow [2025-03-14 01:47:54,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 155 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:54,844 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 531 flow [2025-03-14 01:47:54,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=134, PETRI_TRANSITIONS=150} [2025-03-14 01:47:54,845 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2025-03-14 01:47:54,845 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 531 flow [2025-03-14 01:47:54,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:54,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:54,845 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] [2025-03-14 01:47:54,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:47:54,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:54,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 780662488, now seen corresponding path program 1 times [2025-03-14 01:47:54,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:54,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676119679] [2025-03-14 01:47:54,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:54,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:47:54,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:47:54,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:54,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:55,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676119679] [2025-03-14 01:47:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676119679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:55,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:55,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:55,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334860651] [2025-03-14 01:47:55,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:55,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:55,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:55,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:55,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-03-14 01:47:55,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:55,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:55,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-03-14 01:47:55,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:55,827 INFO L124 PetriNetUnfolderBase]: 2422/6861 cut-off events. [2025-03-14 01:47:55,827 INFO L125 PetriNetUnfolderBase]: For 1842/2195 co-relation queries the response was YES. [2025-03-14 01:47:55,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14967 conditions, 6861 events. 2422/6861 cut-off events. For 1842/2195 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 62783 event pairs, 537 based on Foata normal form. 17/6346 useless extension candidates. Maximal degree in co-relation 14865. Up to 2872 conditions per place. [2025-03-14 01:47:55,874 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2025-03-14 01:47:55,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 1359 flow [2025-03-14 01:47:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2025-03-14 01:47:55,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9028985507246376 [2025-03-14 01:47:55,877 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 531 flow. Second operand 6 states and 623 transitions. [2025-03-14 01:47:55,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 1359 flow [2025-03-14 01:47:55,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:47:55,891 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2025-03-14 01:47:55,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=136, PETRI_TRANSITIONS=233} [2025-03-14 01:47:55,892 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2025-03-14 01:47:55,892 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2025-03-14 01:47:55,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:55,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:55,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:47:55,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash -85106420, now seen corresponding path program 1 times [2025-03-14 01:47:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881343797] [2025-03-14 01:47:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:55,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:47:55,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:47:55,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:55,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:56,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881343797] [2025-03-14 01:47:56,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881343797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:56,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:56,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:47:56,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012623576] [2025-03-14 01:47:56,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:56,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:47:56,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:56,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:47:56,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:47:56,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115 [2025-03-14 01:47:56,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 233 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:56,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:56,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115 [2025-03-14 01:47:56,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:56,930 INFO L124 PetriNetUnfolderBase]: 3064/8850 cut-off events. [2025-03-14 01:47:56,930 INFO L125 PetriNetUnfolderBase]: For 6900/7199 co-relation queries the response was YES. [2025-03-14 01:47:56,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24585 conditions, 8850 events. 3064/8850 cut-off events. For 6900/7199 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 87974 event pairs, 525 based on Foata normal form. 14/8288 useless extension candidates. Maximal degree in co-relation 23620. Up to 4183 conditions per place. [2025-03-14 01:47:56,987 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2025-03-14 01:47:56,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2025-03-14 01:47:56,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:47:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:47:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-03-14 01:47:56,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463768115942029 [2025-03-14 01:47:56,989 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2025-03-14 01:47:56,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2025-03-14 01:47:57,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:57,019 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2025-03-14 01:47:57,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2007, PETRI_PLACES=146, PETRI_TRANSITIONS=299} [2025-03-14 01:47:57,020 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2025-03-14 01:47:57,020 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2025-03-14 01:47:57,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:57,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:57,020 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:57,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:47:57,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:57,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash -268987459, now seen corresponding path program 1 times [2025-03-14 01:47:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270806459] [2025-03-14 01:47:57,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:57,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:47:57,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:47:57,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:57,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270806459] [2025-03-14 01:47:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270806459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:57,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:47:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173827594] [2025-03-14 01:47:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:57,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:47:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:57,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:47:57,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:47:57,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 115 [2025-03-14 01:47:57,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 11 states, 11 states have (on average 78.18181818181819) internal successors, (860), 11 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:57,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:57,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 115 [2025-03-14 01:47:57,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:58,960 INFO L124 PetriNetUnfolderBase]: 3384/9635 cut-off events. [2025-03-14 01:47:58,960 INFO L125 PetriNetUnfolderBase]: For 13100/13467 co-relation queries the response was YES. [2025-03-14 01:47:58,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30610 conditions, 9635 events. 3384/9635 cut-off events. For 13100/13467 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 96499 event pairs, 476 based on Foata normal form. 112/9173 useless extension candidates. Maximal degree in co-relation 29350. Up to 3013 conditions per place. [2025-03-14 01:47:59,035 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 310 selfloop transitions, 36 changer transitions 0/430 dead transitions. [2025-03-14 01:47:59,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 430 transitions, 3901 flow [2025-03-14 01:47:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:47:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:47:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1074 transitions. [2025-03-14 01:47:59,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183946488294315 [2025-03-14 01:47:59,038 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 1074 transitions. [2025-03-14 01:47:59,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 430 transitions, 3901 flow [2025-03-14 01:47:59,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 430 transitions, 3761 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-03-14 01:47:59,082 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2025-03-14 01:47:59,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1935, PETRI_PLACES=157, PETRI_TRANSITIONS=298} [2025-03-14 01:47:59,083 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2025-03-14 01:47:59,083 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2025-03-14 01:47:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 78.18181818181819) internal successors, (860), 11 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:59,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:59,084 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:59,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:47:59,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:47:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1005912231, now seen corresponding path program 1 times [2025-03-14 01:47:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:59,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482458043] [2025-03-14 01:47:59,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:59,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:59,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:47:59,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:47:59,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:59,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:47:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482458043] [2025-03-14 01:47:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482458043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:47:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816328797] [2025-03-14 01:47:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:59,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:47:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:59,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:47:59,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:47:59,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-14 01:47:59,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 298 transitions, 1935 flow. Second operand has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:59,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:59,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-14 01:47:59,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:01,030 INFO L124 PetriNetUnfolderBase]: 5095/13018 cut-off events. [2025-03-14 01:48:01,030 INFO L125 PetriNetUnfolderBase]: For 18403/20350 co-relation queries the response was YES. [2025-03-14 01:48:01,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43784 conditions, 13018 events. 5095/13018 cut-off events. For 18403/20350 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 128753 event pairs, 581 based on Foata normal form. 295/12773 useless extension candidates. Maximal degree in co-relation 39872. Up to 3164 conditions per place. [2025-03-14 01:48:01,105 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2025-03-14 01:48:01,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2025-03-14 01:48:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 01:48:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 01:48:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2025-03-14 01:48:01,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7695652173913043 [2025-03-14 01:48:01,109 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2025-03-14 01:48:01,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2025-03-14 01:48:01,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-14 01:48:01,174 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2025-03-14 01:48:01,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4571, PETRI_PLACES=172, PETRI_TRANSITIONS=504} [2025-03-14 01:48:01,175 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2025-03-14 01:48:01,175 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2025-03-14 01:48:01,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:01,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:01,176 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] [2025-03-14 01:48:01,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:48:01,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:48:01,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2039983165, now seen corresponding path program 1 times [2025-03-14 01:48:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644464633] [2025-03-14 01:48:01,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:01,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:48:01,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:48:01,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:01,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644464633] [2025-03-14 01:48:01,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644464633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:01,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:01,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:48:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439537620] [2025-03-14 01:48:01,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:01,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:48:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:01,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:48:01,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:48:01,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-14 01:48:01,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 504 transitions, 4571 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:01,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:01,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-14 01:48:01,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:03,178 INFO L124 PetriNetUnfolderBase]: 4491/12034 cut-off events. [2025-03-14 01:48:03,178 INFO L125 PetriNetUnfolderBase]: For 34179/34682 co-relation queries the response was YES. [2025-03-14 01:48:03,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48021 conditions, 12034 events. 4491/12034 cut-off events. For 34179/34682 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 121133 event pairs, 440 based on Foata normal form. 182/11651 useless extension candidates. Maximal degree in co-relation 46664. Up to 3239 conditions per place. [2025-03-14 01:48:03,258 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2025-03-14 01:48:03,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2025-03-14 01:48:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:48:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:48:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2025-03-14 01:48:03,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7344481605351171 [2025-03-14 01:48:03,261 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2025-03-14 01:48:03,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2025-03-14 01:48:03,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-03-14 01:48:03,403 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2025-03-14 01:48:03,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4585, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2025-03-14 01:48:03,404 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2025-03-14 01:48:03,404 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2025-03-14 01:48:03,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:03,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:03,405 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:03,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:48:03,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:48:03,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash -317404852, now seen corresponding path program 1 times [2025-03-14 01:48:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:03,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790066628] [2025-03-14 01:48:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:03,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:48:03,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:48:03,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:03,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:48:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790066628] [2025-03-14 01:48:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790066628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:03,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39034073] [2025-03-14 01:48:03,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:03,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:03,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:03,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-03-14 01:48:03,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 4585 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:03,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:03,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-03-14 01:48:03,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:04,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([330] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_9, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_9, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][342], [Black: 130#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 132#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 131#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 88#L1022-2true, Black: 129#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 118#true, 239#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 263#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 140#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 45#L1036true, Black: 151#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 152#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 202#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 205#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 221#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 206#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 207#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 219#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 99#L1022-5true, Black: 161#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 223#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 197#true, Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 217#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 203#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 204#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 149#true, 159#true, 125#(= |#race~datas~0| 0), 116#true, 127#true, Black: 123#true]) [2025-03-14 01:48:04,320 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-14 01:48:04,320 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-14 01:48:04,320 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-14 01:48:04,320 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-14 01:48:06,240 INFO L124 PetriNetUnfolderBase]: 9675/22073 cut-off events. [2025-03-14 01:48:06,240 INFO L125 PetriNetUnfolderBase]: For 74523/75412 co-relation queries the response was YES. [2025-03-14 01:48:06,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90108 conditions, 22073 events. 9675/22073 cut-off events. For 74523/75412 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 226607 event pairs, 1069 based on Foata normal form. 11/20941 useless extension candidates. Maximal degree in co-relation 88045. Up to 11087 conditions per place. [2025-03-14 01:48:06,395 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2025-03-14 01:48:06,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2025-03-14 01:48:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-03-14 01:48:06,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971014492753623 [2025-03-14 01:48:06,397 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2025-03-14 01:48:06,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2025-03-14 01:48:06,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-14 01:48:06,783 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2025-03-14 01:48:06,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8336, PETRI_PLACES=175, PETRI_TRANSITIONS=778} [2025-03-14 01:48:06,784 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2025-03-14 01:48:06,784 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2025-03-14 01:48:06,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:06,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:06,784 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:06,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:48:06,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-14 01:48:06,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1098564932, now seen corresponding path program 1 times [2025-03-14 01:48:06,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:06,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933066693] [2025-03-14 01:48:06,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:06,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:06,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:48:06,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:48:06,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:06,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:48:06,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:48:06,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:48:06,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:48:06,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:06,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:48:06,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:48:06,819 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:48:06,819 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-14 01:48:06,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-14 01:48:06,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:48:06,820 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:06,821 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:48:06,821 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:48:06,838 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:48:06,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 136 transitions, 299 flow [2025-03-14 01:48:06,859 INFO L124 PetriNetUnfolderBase]: 9/356 cut-off events. [2025-03-14 01:48:06,860 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-03-14 01:48:06,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 356 events. 9/356 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1028 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 224. Up to 12 conditions per place. [2025-03-14 01:48:06,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 136 transitions, 299 flow [2025-03-14 01:48:06,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 299 flow [2025-03-14 01:48:06,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:48:06,865 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;@29e94211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:48:06,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-14 01:48:06,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:48:06,867 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-14 01:48:06,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:48:06,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:06,867 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-14 01:48:06,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:06,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1500251136, now seen corresponding path program 1 times [2025-03-14 01:48:06,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:06,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296684915] [2025-03-14 01:48:06,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:06,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:06,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:48:06,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:48:06,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:06,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:06,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296684915] [2025-03-14 01:48:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296684915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:06,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:06,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:06,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148170929] [2025-03-14 01:48:06,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:06,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:06,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:06,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:06,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:06,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-03-14 01:48:06,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:06,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:06,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-03-14 01:48:06,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:06,972 INFO L124 PetriNetUnfolderBase]: 90/1260 cut-off events. [2025-03-14 01:48:06,972 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-14 01:48:06,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 90/1260 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8352 event pairs, 81 based on Foata normal form. 1/1092 useless extension candidates. Maximal degree in co-relation 877. Up to 178 conditions per place. [2025-03-14 01:48:06,979 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-14 01:48:06,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2025-03-14 01:48:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-14 01:48:06,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9117647058823529 [2025-03-14 01:48:06,981 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 299 flow. Second operand 3 states and 372 transitions. [2025-03-14 01:48:06,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2025-03-14 01:48:06,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:06,983 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2025-03-14 01:48:06,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2025-03-14 01:48:06,983 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2025-03-14 01:48:06,983 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2025-03-14 01:48:06,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:06,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:06,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:06,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:48:06,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:06,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:06,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1269625815, now seen corresponding path program 1 times [2025-03-14 01:48:06,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:06,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227104425] [2025-03-14 01:48:06,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:06,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:06,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:48:06,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:48:06,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:06,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:06,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227104425] [2025-03-14 01:48:06,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227104425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:07,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:07,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:48:07,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008184838] [2025-03-14 01:48:07,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:07,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:48:07,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:07,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:48:07,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:48:07,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-03-14 01:48:07,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:07,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:07,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-03-14 01:48:07,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:07,256 INFO L124 PetriNetUnfolderBase]: 307/2452 cut-off events. [2025-03-14 01:48:07,256 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2025-03-14 01:48:07,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2452 events. 307/2452 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19843 event pairs, 214 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 3039. Up to 507 conditions per place. [2025-03-14 01:48:07,267 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-03-14 01:48:07,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2025-03-14 01:48:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:48:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:48:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-14 01:48:07,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9142156862745098 [2025-03-14 01:48:07,269 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2025-03-14 01:48:07,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2025-03-14 01:48:07,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:48:07,271 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2025-03-14 01:48:07,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-03-14 01:48:07,271 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2025-03-14 01:48:07,271 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2025-03-14 01:48:07,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:07,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:07,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:07,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:48:07,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:07,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash -728964982, now seen corresponding path program 1 times [2025-03-14 01:48:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:07,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773235348] [2025-03-14 01:48:07,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:07,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:48:07,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:48:07,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:07,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:07,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773235348] [2025-03-14 01:48:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773235348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:07,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764343582] [2025-03-14 01:48:07,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:48:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:07,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:48:07,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:48:07,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-03-14 01:48:07,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:07,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:07,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-03-14 01:48:07,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:07,432 INFO L124 PetriNetUnfolderBase]: 50/854 cut-off events. [2025-03-14 01:48:07,432 INFO L125 PetriNetUnfolderBase]: For 85/133 co-relation queries the response was YES. [2025-03-14 01:48:07,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 854 events. 50/854 cut-off events. For 85/133 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4658 event pairs, 17 based on Foata normal form. 2/795 useless extension candidates. Maximal degree in co-relation 600. Up to 98 conditions per place. [2025-03-14 01:48:07,437 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 16 selfloop transitions, 2 changer transitions 5/139 dead transitions. [2025-03-14 01:48:07,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 371 flow [2025-03-14 01:48:07,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-03-14 01:48:07,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-03-14 01:48:07,438 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 732 transitions. [2025-03-14 01:48:07,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 371 flow [2025-03-14 01:48:07,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:07,441 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 335 flow [2025-03-14 01:48:07,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=145, PETRI_TRANSITIONS=134} [2025-03-14 01:48:07,442 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-03-14 01:48:07,442 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 335 flow [2025-03-14 01:48:07,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:07,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:07,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:48:07,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:07,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 319027544, now seen corresponding path program 1 times [2025-03-14 01:48:07,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:07,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476287809] [2025-03-14 01:48:07,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:07,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:48:07,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:48:07,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:07,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476287809] [2025-03-14 01:48:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476287809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:07,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:07,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218088173] [2025-03-14 01:48:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:07,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:07,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:07,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:07,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:07,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 136 [2025-03-14 01:48:07,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:07,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:07,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 136 [2025-03-14 01:48:07,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:09,396 INFO L124 PetriNetUnfolderBase]: 10321/23631 cut-off events. [2025-03-14 01:48:09,396 INFO L125 PetriNetUnfolderBase]: For 2020/2079 co-relation queries the response was YES. [2025-03-14 01:48:09,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40653 conditions, 23631 events. 10321/23631 cut-off events. For 2020/2079 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 239262 event pairs, 6820 based on Foata normal form. 0/21682 useless extension candidates. Maximal degree in co-relation 35491. Up to 14058 conditions per place. [2025-03-14 01:48:09,494 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 38 selfloop transitions, 54 changer transitions 0/189 dead transitions. [2025-03-14 01:48:09,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 641 flow [2025-03-14 01:48:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2025-03-14 01:48:09,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8406862745098039 [2025-03-14 01:48:09,496 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 335 flow. Second operand 6 states and 686 transitions. [2025-03-14 01:48:09,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 641 flow [2025-03-14 01:48:09,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 629 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-14 01:48:09,502 INFO L231 Difference]: Finished difference. Result has 148 places, 187 transitions, 681 flow [2025-03-14 01:48:09,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=681, PETRI_PLACES=148, PETRI_TRANSITIONS=187} [2025-03-14 01:48:09,503 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-03-14 01:48:09,503 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 681 flow [2025-03-14 01:48:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:09,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:09,503 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] [2025-03-14 01:48:09,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:48:09,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:09,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:09,504 INFO L85 PathProgramCache]: Analyzing trace with hash -605889973, now seen corresponding path program 1 times [2025-03-14 01:48:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:09,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738212782] [2025-03-14 01:48:09,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:09,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:48:09,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:48:09,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738212782] [2025-03-14 01:48:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738212782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:09,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867494703] [2025-03-14 01:48:09,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:09,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2025-03-14 01:48:09,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:09,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:09,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2025-03-14 01:48:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:12,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][290], [30#L1031-3true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 16#L1022-2true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 136#true, 171#true, 51#L1022-4true, 140#true, 147#(= |#race~datas~0| 0), Black: 145#true, 138#true, 160#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L1022-5true]) [2025-03-14 01:48:12,939 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-14 01:48:12,940 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:48:12,940 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:48:12,940 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:48:13,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][290], [30#L1031-3true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 16#L1022-2true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 5#L1022-3true, 136#true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 145#true, 138#true, 160#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L1022-5true]) [2025-03-14 01:48:13,243 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,243 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,243 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,243 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][235], [30#L1031-3true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 136#true, 171#true, 147#(= |#race~datas~0| 0), 140#true, 15#L1023true, Black: 145#true, 138#true, 160#true, 46#L1022-5true, 82#L1022-5true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-03-14 01:48:13,338 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,338 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,338 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,339 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:13,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][290], [75#L1022-1true, 30#L1031-3true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 16#L1022-2true, Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 136#true, 171#true, 140#true, 147#(= |#race~datas~0| 0), Black: 145#true, 138#true, 160#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L1022-5true]) [2025-03-14 01:48:13,362 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-14 01:48:13,362 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:13,362 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:13,362 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:14,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][235], [30#L1031-3true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 136#true, 51#L1022-4true, 171#true, 140#true, 147#(= |#race~datas~0| 0), 15#L1023true, Black: 145#true, 138#true, 160#true, 82#L1022-5true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-03-14 01:48:14,399 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-14 01:48:14,399 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:14,399 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:14,399 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:15,591 INFO L124 PetriNetUnfolderBase]: 29118/67432 cut-off events. [2025-03-14 01:48:15,591 INFO L125 PetriNetUnfolderBase]: For 19553/23106 co-relation queries the response was YES. [2025-03-14 01:48:15,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151080 conditions, 67432 events. 29118/67432 cut-off events. For 19553/23106 co-relation queries the response was YES. Maximal size of possible extension queue 2177. Compared 778247 event pairs, 6924 based on Foata normal form. 84/62011 useless extension candidates. Maximal degree in co-relation 123255. Up to 28787 conditions per place. [2025-03-14 01:48:16,154 INFO L140 encePairwiseOnDemand]: 113/136 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2025-03-14 01:48:16,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 349 transitions, 1945 flow [2025-03-14 01:48:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2025-03-14 01:48:16,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105392156862745 [2025-03-14 01:48:16,156 INFO L175 Difference]: Start difference. First operand has 148 places, 187 transitions, 681 flow. Second operand 6 states and 743 transitions. [2025-03-14 01:48:16,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 349 transitions, 1945 flow [2025-03-14 01:48:16,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:16,264 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2025-03-14 01:48:16,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=157, PETRI_TRANSITIONS=304} [2025-03-14 01:48:16,265 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2025-03-14 01:48:16,265 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2025-03-14 01:48:16,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:16,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:16,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:16,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:48:16,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:16,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:16,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1306025561, now seen corresponding path program 1 times [2025-03-14 01:48:16,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:16,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754418182] [2025-03-14 01:48:16,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:16,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:48:16,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:48:16,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:16,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754418182] [2025-03-14 01:48:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754418182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:16,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:48:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547844095] [2025-03-14 01:48:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:16,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:48:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:16,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:48:16,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:48:16,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 136 [2025-03-14 01:48:16,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 304 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:16,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:16,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 136 [2025-03-14 01:48:16,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:24,765 INFO L124 PetriNetUnfolderBase]: 35372/83044 cut-off events. [2025-03-14 01:48:24,765 INFO L125 PetriNetUnfolderBase]: For 74381/76862 co-relation queries the response was YES. [2025-03-14 01:48:25,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242971 conditions, 83044 events. 35372/83044 cut-off events. For 74381/76862 co-relation queries the response was YES. Maximal size of possible extension queue 2684. Compared 1007508 event pairs, 8760 based on Foata normal form. 195/77523 useless extension candidates. Maximal degree in co-relation 233051. Up to 43645 conditions per place. [2025-03-14 01:48:25,384 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2025-03-14 01:48:25,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2025-03-14 01:48:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:48:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:48:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2025-03-14 01:48:25,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-14 01:48:25,386 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2025-03-14 01:48:25,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2025-03-14 01:48:26,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:26,126 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2025-03-14 01:48:26,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2981, PETRI_PLACES=167, PETRI_TRANSITIONS=409} [2025-03-14 01:48:26,127 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2025-03-14 01:48:26,127 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2025-03-14 01:48:26,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:26,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:26,128 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:26,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:48:26,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:26,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:26,128 INFO L85 PathProgramCache]: Analyzing trace with hash -897530460, now seen corresponding path program 1 times [2025-03-14 01:48:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:26,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946408686] [2025-03-14 01:48:26,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:48:26,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:48:26,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:26,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:26,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946408686] [2025-03-14 01:48:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946408686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:26,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:26,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:48:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750685367] [2025-03-14 01:48:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:26,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:48:26,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:26,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:48:26,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:48:26,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 136 [2025-03-14 01:48:26,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 409 transitions, 2981 flow. Second operand has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:26,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:26,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 136 [2025-03-14 01:48:26,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:48:32,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][373], [42#L1022-1true, 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 119#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 147#(= |#race~datas~0| 0), Black: 145#true, 181#true, 138#true, 82#L1022-5true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 75#L1022-1true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 136#true, 171#true, Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 140#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 160#true, Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0))]) [2025-03-14 01:48:32,704 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-14 01:48:32,704 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:32,704 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:32,704 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-14 01:48:34,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][373], [42#L1022-1true, 210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 119#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 147#(= |#race~datas~0| 0), Black: 145#true, 181#true, 138#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L1022-5true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 5#L1022-3true, 136#true, 171#true, Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 140#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 160#true, Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0))]) [2025-03-14 01:48:34,117 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-14 01:48:34,117 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:48:34,117 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:48:34,117 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-14 01:48:35,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][382], [210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 119#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 147#(= |#race~datas~0| 0), Black: 145#true, 181#true, 138#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L1022-5true, 75#L1022-1true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 16#L1022-2true, Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 136#true, 171#true, Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 140#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 160#true, Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0))]) [2025-03-14 01:48:35,085 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-14 01:48:35,085 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:35,085 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:35,085 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-14 01:48:35,413 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L1022-6-->L1022-5: Formula: (= (store |v_#race_30| v_~datas~0.base_9 (store (select |v_#race_30| v_~datas~0.base_9) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_9) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} OutVars{#race=|v_#race_29|, ~datas~0.base=v_~datas~0.base_9, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_9} AuxVars[] AssignedVars[#race][373], [210#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 119#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 147#(= |#race~datas~0| 0), Black: 145#true, 181#true, 138#true, Black: 151#(= |ULTIMATE.start_main_~i~1#1| 0), 82#L1022-5true, 75#L1022-1true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), 108#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 136#true, 171#true, Black: 175#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 176#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 2 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), Black: 173#(= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|), 140#true, Black: 174#(and (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset)) |threadThread1of3ForFork0_#t~nondet4|) (= (select (select |#race| ~datas~0.base) (+ (* threadThread1of3ForFork0_~i~0 4) ~datas~0.offset 1)) |threadThread1of3ForFork0_#t~nondet4|)), 160#true, Black: 183#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 185#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 186#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 184#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0))]) [2025-03-14 01:48:35,413 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2025-03-14 01:48:35,413 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-14 01:48:35,413 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-14 01:48:35,413 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-14 01:48:37,195 INFO L124 PetriNetUnfolderBase]: 39328/91205 cut-off events. [2025-03-14 01:48:37,195 INFO L125 PetriNetUnfolderBase]: For 149368/154298 co-relation queries the response was YES. [2025-03-14 01:48:37,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311047 conditions, 91205 events. 39328/91205 cut-off events. For 149368/154298 co-relation queries the response was YES. Maximal size of possible extension queue 2988. Compared 1105483 event pairs, 7238 based on Foata normal form. 869/86382 useless extension candidates. Maximal degree in co-relation 298058. Up to 36115 conditions per place. [2025-03-14 01:48:38,253 INFO L140 encePairwiseOnDemand]: 122/136 looper letters, 495 selfloop transitions, 36 changer transitions 0/630 dead transitions. [2025-03-14 01:48:38,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 630 transitions, 6073 flow [2025-03-14 01:48:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:48:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:48:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1299 transitions. [2025-03-14 01:48:38,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347285067873304 [2025-03-14 01:48:38,255 INFO L175 Difference]: Start difference. First operand has 167 places, 409 transitions, 2981 flow. Second operand 13 states and 1299 transitions. [2025-03-14 01:48:38,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 630 transitions, 6073 flow [2025-03-14 01:48:38,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 630 transitions, 5849 flow, removed 112 selfloop flow, removed 0 redundant places. [2025-03-14 01:48:38,900 INFO L231 Difference]: Finished difference. Result has 178 places, 408 transitions, 2825 flow [2025-03-14 01:48:38,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2753, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2825, PETRI_PLACES=178, PETRI_TRANSITIONS=408} [2025-03-14 01:48:38,901 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 39 predicate places. [2025-03-14 01:48:38,901 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 408 transitions, 2825 flow [2025-03-14 01:48:38,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 93.18181818181819) internal successors, (1025), 11 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:38,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:48:38,901 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:48:38,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 01:48:38,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-14 01:48:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:48:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2104610856, now seen corresponding path program 1 times [2025-03-14 01:48:38,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:48:38,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226298792] [2025-03-14 01:48:38,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:48:38,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:48:38,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-14 01:48:38,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-14 01:48:38,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:48:38,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:48:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:48:39,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:48:39,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226298792] [2025-03-14 01:48:39,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226298792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:48:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:48:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 01:48:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870647481] [2025-03-14 01:48:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:48:39,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:48:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:48:39,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:48:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:48:39,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 136 [2025-03-14 01:48:39,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 408 transitions, 2825 flow. Second operand has 11 states, 11 states have (on average 94.9090909090909) internal successors, (1044), 11 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:48:39,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:48:39,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 136 [2025-03-14 01:48:39,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand