./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.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 b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:27:58,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:27:58,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:27:58,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:27:58,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:27:58,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:27:58,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:27:58,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:27:58,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:27:58,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:27:58,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:27:58,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:27:58,763 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:27:58,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:27:58,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:27:58,763 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:27:58,764 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:27:58,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:27:58,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:27:58,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:27:58,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:27:58,766 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 -> b606ed8b0061f7540a480987fb5d0368be6ab145ef928bee0cc134c3bece9590 [2025-03-13 22:27:59,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:27:59,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:27:59,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:27:59,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:27:59,013 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:27:59,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i [2025-03-13 22:28:00,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560309b22/1f74b9ee07564744a7423913d94a582d/FLAG8154abf93 [2025-03-13 22:28:00,420 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:28:00,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race-2.i [2025-03-13 22:28:00,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560309b22/1f74b9ee07564744a7423913d94a582d/FLAG8154abf93 [2025-03-13 22:28:00,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560309b22/1f74b9ee07564744a7423913d94a582d [2025-03-13 22:28:00,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:28:00,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:28:00,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:00,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:28:00,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:28:00,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00, skipping insertion in model container [2025-03-13 22:28:00,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:28:00,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:00,837 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:28:00,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:00,909 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:28:00,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00 WrapperNode [2025-03-13 22:28:00,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:00,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:00,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:28:00,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:28:00,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,938 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-13 22:28:00,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:00,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:28:00,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:28:00,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:28:00,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:28:00,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:28:00,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:28:00,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:28:00,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (1/1) ... [2025-03-13 22:28:00,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:28:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:28:00,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:28:00,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:28:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:28:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:28:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:28:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:28:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:28:01,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:28:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:28:01,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:28:01,021 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:28:01,108 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:28:01,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:28:01,275 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:28:01,275 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:28:01,275 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:28:01,286 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:28:01,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:01 BoogieIcfgContainer [2025-03-13 22:28:01,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:28:01,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:28:01,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:28:01,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:28:01,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:28:00" (1/3) ... [2025-03-13 22:28:01,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56619012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:01, skipping insertion in model container [2025-03-13 22:28:01,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:00" (2/3) ... [2025-03-13 22:28:01,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56619012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:01, skipping insertion in model container [2025-03-13 22:28:01,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:01" (3/3) ... [2025-03-13 22:28:01,297 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race-2.i [2025-03-13 22:28:01,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:28:01,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race-2.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-13 22:28:01,312 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:28:01,369 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:28:01,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 94 transitions, 195 flow [2025-03-13 22:28:01,450 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-03-13 22:28:01,452 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:28:01,456 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-13 22:28:01,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 94 transitions, 195 flow [2025-03-13 22:28:01,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 94 transitions, 195 flow [2025-03-13 22:28:01,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:01,478 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;@28ff0942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:01,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:28:01,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:01,486 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-13 22:28:01,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:01,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:01,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:01,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:01,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1488212005, now seen corresponding path program 1 times [2025-03-13 22:28:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:01,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083566849] [2025-03-13 22:28:01,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:01,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:28:01,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:28:01,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:01,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:01,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083566849] [2025-03-13 22:28:01,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083566849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:01,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689756508] [2025-03-13 22:28:01,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:01,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:01,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:01,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:01,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2025-03-13 22:28:01,777 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-13 22:28:01,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:01,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2025-03-13 22:28:01,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:01,830 INFO L124 PetriNetUnfolderBase]: 3/161 cut-off events. [2025-03-13 22:28:01,832 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:28:01,833 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-13 22:28:01,835 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2025-03-13 22:28:01,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2025-03-13 22:28:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-03-13 22:28:01,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-03-13 22:28:01,849 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 195 flow. Second operand 3 states and 258 transitions. [2025-03-13 22:28:01,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2025-03-13 22:28:01,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:01,857 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2025-03-13 22:28:01,859 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-13 22:28:01,862 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2025-03-13 22:28:01,862 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2025-03-13 22:28:01,862 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-13 22:28:01,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:01,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:01,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:28:01,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:01,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash -138830217, now seen corresponding path program 1 times [2025-03-13 22:28:01,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:01,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165539319] [2025-03-13 22:28:01,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:01,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:01,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:01,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:01,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:01,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165539319] [2025-03-13 22:28:01,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165539319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:01,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:01,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:01,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130447316] [2025-03-13 22:28:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:01,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:01,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:01,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:01,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:01,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 94 [2025-03-13 22:28:01,955 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-13 22:28:01,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:01,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 94 [2025-03-13 22:28:01,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:01,997 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2025-03-13 22:28:01,997 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:28:01,998 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-13 22:28:01,998 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-13 22:28:01,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2025-03-13 22:28:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:01,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-03-13 22:28:02,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326241134751773 [2025-03-13 22:28:02,001 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2025-03-13 22:28:02,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2025-03-13 22:28:02,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:02,004 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2025-03-13 22:28:02,004 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-13 22:28:02,005 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-03-13 22:28:02,005 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2025-03-13 22:28:02,006 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-13 22:28:02,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:02,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:02,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:28:02,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:02,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash -292529000, now seen corresponding path program 1 times [2025-03-13 22:28:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-03-13 22:28:02,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:02,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:02,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:02,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:02,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:02,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:02,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:02,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552176574] [2025-03-13 22:28:02,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552176574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:02,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783070649] [2025-03-13 22:28:02,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:02,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:02,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:02,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:02,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 94 [2025-03-13 22:28:02,625 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-13 22:28:02,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:02,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 94 [2025-03-13 22:28:02,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:02,736 INFO L124 PetriNetUnfolderBase]: 73/402 cut-off events. [2025-03-13 22:28:02,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 22:28:02,739 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-13 22:28:02,741 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2025-03-13 22:28:02,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 331 flow [2025-03-13 22:28:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2025-03-13 22:28:02,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8156028368794326 [2025-03-13 22:28:02,745 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 460 transitions. [2025-03-13 22:28:02,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 331 flow [2025-03-13 22:28:02,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:02,747 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 349 flow [2025-03-13 22:28:02,747 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-13 22:28:02,748 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2025-03-13 22:28:02,748 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 349 flow [2025-03-13 22:28:02,748 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-13 22:28:02,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:02,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:28:02,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1340521526, now seen corresponding path program 1 times [2025-03-13 22:28:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884630139] [2025-03-13 22:28:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:02,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:02,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:02,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:02,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884630139] [2025-03-13 22:28:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884630139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312542449] [2025-03-13 22:28:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:02,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:02,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:02,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:02,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-03-13 22:28:02,902 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-13 22:28:02,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:02,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-03-13 22:28:02,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:02,943 INFO L124 PetriNetUnfolderBase]: 34/262 cut-off events. [2025-03-13 22:28:02,943 INFO L125 PetriNetUnfolderBase]: For 37/45 co-relation queries the response was YES. [2025-03-13 22:28:02,944 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-13 22:28:02,945 INFO L140 encePairwiseOnDemand]: 86/94 looper letters, 11 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2025-03-13 22:28:02,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 395 flow [2025-03-13 22:28:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2025-03-13 22:28:02,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8847517730496454 [2025-03-13 22:28:02,946 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 349 flow. Second operand 6 states and 499 transitions. [2025-03-13 22:28:02,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 395 flow [2025-03-13 22:28:02,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:02,949 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 367 flow [2025-03-13 22:28:02,950 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-13 22:28:02,950 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2025-03-13 22:28:02,950 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 367 flow [2025-03-13 22:28:02,950 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-13 22:28:02,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:02,950 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-13 22:28:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:28:02,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1115899733, now seen corresponding path program 1 times [2025-03-13 22:28:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-03-13 22:28:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:02,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:28:02,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:28:02,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882556843] [2025-03-13 22:28:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882556843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:03,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:03,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559120703] [2025-03-13 22:28:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:03,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:03,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:03,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:03,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2025-03-13 22:28:03,345 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-13 22:28:03,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:03,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2025-03-13 22:28:03,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:03,509 INFO L124 PetriNetUnfolderBase]: 131/506 cut-off events. [2025-03-13 22:28:03,509 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2025-03-13 22:28:03,511 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-13 22:28:03,513 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2025-03-13 22:28:03,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 689 flow [2025-03-13 22:28:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2025-03-13 22:28:03,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8705673758865248 [2025-03-13 22:28:03,516 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 367 flow. Second operand 6 states and 491 transitions. [2025-03-13 22:28:03,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 689 flow [2025-03-13 22:28:03,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:03,525 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2025-03-13 22:28:03,527 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-13 22:28:03,527 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2025-03-13 22:28:03,529 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2025-03-13 22:28:03,529 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-13 22:28:03,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:03,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:28:03,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -275567546, now seen corresponding path program 1 times [2025-03-13 22:28:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-03-13 22:28:03,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:03,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:28:03,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:28:03,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:03,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:03,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920229731] [2025-03-13 22:28:03,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920229731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:03,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:03,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161533015] [2025-03-13 22:28:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:03,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:03,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:03,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:03,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2025-03-13 22:28:03,959 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-13 22:28:03,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:03,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2025-03-13 22:28:03,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:04,059 INFO L124 PetriNetUnfolderBase]: 142/512 cut-off events. [2025-03-13 22:28:04,061 INFO L125 PetriNetUnfolderBase]: For 428/432 co-relation queries the response was YES. [2025-03-13 22:28:04,062 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-13 22:28:04,064 INFO L140 encePairwiseOnDemand]: 83/94 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2025-03-13 22:28:04,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2025-03-13 22:28:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2025-03-13 22:28:04,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8315602836879432 [2025-03-13 22:28:04,066 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2025-03-13 22:28:04,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2025-03-13 22:28:04,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-13 22:28:04,073 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2025-03-13 22:28:04,073 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-13 22:28:04,074 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2025-03-13 22:28:04,074 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2025-03-13 22:28:04,074 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-13 22:28:04,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,074 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:28:04,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:28:04,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1824629221, now seen corresponding path program 1 times [2025-03-13 22:28:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821167350] [2025-03-13 22:28:04,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:28:04,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:28:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:04,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:28:04,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:28:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:28:04,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:04,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:28:04,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:28:04,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 22:28:04,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 22:28:04,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 22:28:04,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 22:28:04,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 22:28:04,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 22:28:04,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-13 22:28:04,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 22:28:04,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 22:28:04,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:28:04,124 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:04,127 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:28:04,127 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:28:04,145 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:28:04,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 246 flow [2025-03-13 22:28:04,171 INFO L124 PetriNetUnfolderBase]: 4/216 cut-off events. [2025-03-13 22:28:04,171 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:28:04,172 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-13 22:28:04,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 246 flow [2025-03-13 22:28:04,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 246 flow [2025-03-13 22:28:04,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:04,174 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;@28ff0942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:04,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-13 22:28:04,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:04,176 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-13 22:28:04,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:04,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,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] [2025-03-13 22:28:04,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -200302984, now seen corresponding path program 1 times [2025-03-13 22:28:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963116463] [2025-03-13 22:28:04,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:28:04,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:28:04,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963116463] [2025-03-13 22:28:04,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963116463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771378821] [2025-03-13 22:28:04,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:04,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:04,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-03-13 22:28:04,217 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-13 22:28:04,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-03-13 22:28:04,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:04,264 INFO L124 PetriNetUnfolderBase]: 19/441 cut-off events. [2025-03-13 22:28:04,264 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 22:28:04,265 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-13 22:28:04,266 INFO L140 encePairwiseOnDemand]: 111/115 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2025-03-13 22:28:04,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2025-03-13 22:28:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2025-03-13 22:28:04,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-13 22:28:04,271 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 246 flow. Second operand 3 states and 315 transitions. [2025-03-13 22:28:04,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2025-03-13 22:28:04,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:04,273 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2025-03-13 22:28:04,273 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-13 22:28:04,273 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2025-03-13 22:28:04,273 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2025-03-13 22:28:04,274 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-13 22:28:04,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:28:04,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1464718039, now seen corresponding path program 1 times [2025-03-13 22:28:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143980516] [2025-03-13 22:28:04,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:04,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:04,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143980516] [2025-03-13 22:28:04,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143980516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:04,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650441398] [2025-03-13 22:28:04,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:04,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:04,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:04,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2025-03-13 22:28:04,310 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-13 22:28:04,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2025-03-13 22:28:04,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:04,362 INFO L124 PetriNetUnfolderBase]: 48/598 cut-off events. [2025-03-13 22:28:04,362 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 22:28:04,364 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-13 22:28:04,365 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-03-13 22:28:04,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2025-03-13 22:28:04,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2025-03-13 22:28:04,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9217391304347826 [2025-03-13 22:28:04,367 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2025-03-13 22:28:04,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2025-03-13 22:28:04,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:04,369 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2025-03-13 22:28:04,369 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-13 22:28:04,369 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2025-03-13 22:28:04,369 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2025-03-13 22:28:04,370 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-13 22:28:04,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:04,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:04,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:28:04,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:04,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:04,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1175910568, now seen corresponding path program 1 times [2025-03-13 22:28:04,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:04,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532988599] [2025-03-13 22:28:04,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:04,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:04,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:04,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:04,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532988599] [2025-03-13 22:28:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532988599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436346371] [2025-03-13 22:28:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:04,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:04,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:04,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:04,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:04,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2025-03-13 22:28:04,649 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-13 22:28:04,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:04,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2025-03-13 22:28:04,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:05,006 INFO L124 PetriNetUnfolderBase]: 1014/3169 cut-off events. [2025-03-13 22:28:05,006 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-13 22:28:05,014 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-13 22:28:05,023 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 30 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2025-03-13 22:28:05,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 472 flow [2025-03-13 22:28:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2025-03-13 22:28:05,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8304347826086956 [2025-03-13 22:28:05,025 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 573 transitions. [2025-03-13 22:28:05,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 472 flow [2025-03-13 22:28:05,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:05,028 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 509 flow [2025-03-13 22:28:05,028 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-13 22:28:05,029 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2025-03-13 22:28:05,029 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 509 flow [2025-03-13 22:28:05,030 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-13 22:28:05,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:05,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:05,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:28:05,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:05,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2071064202, now seen corresponding path program 1 times [2025-03-13 22:28:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:05,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553655341] [2025-03-13 22:28:05,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:05,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:05,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:05,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:05,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553655341] [2025-03-13 22:28:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553655341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384811832] [2025-03-13 22:28:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:05,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:05,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:05,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:05,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2025-03-13 22:28:05,160 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-13 22:28:05,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:05,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2025-03-13 22:28:05,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:05,300 INFO L124 PetriNetUnfolderBase]: 484/1788 cut-off events. [2025-03-13 22:28:05,300 INFO L125 PetriNetUnfolderBase]: For 362/424 co-relation queries the response was YES. [2025-03-13 22:28:05,306 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-13 22:28:05,312 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 14 selfloop transitions, 2 changer transitions 5/155 dead transitions. [2025-03-13 22:28:05,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 563 flow [2025-03-13 22:28:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2025-03-13 22:28:05,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8927536231884058 [2025-03-13 22:28:05,314 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 509 flow. Second operand 6 states and 616 transitions. [2025-03-13 22:28:05,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 563 flow [2025-03-13 22:28:05,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 155 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:05,319 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 531 flow [2025-03-13 22:28:05,319 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-13 22:28:05,320 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2025-03-13 22:28:05,320 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 531 flow [2025-03-13 22:28:05,320 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-13 22:28:05,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:05,320 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-13 22:28:05,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:28:05,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:05,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash 780662488, now seen corresponding path program 1 times [2025-03-13 22:28:05,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:05,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677351586] [2025-03-13 22:28:05,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:05,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:28:05,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:28:05,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:05,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677351586] [2025-03-13 22:28:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677351586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:05,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:05,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934234057] [2025-03-13 22:28:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:05,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:05,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:05,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:05,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-03-13 22:28:05,714 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-13 22:28:05,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:05,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-03-13 22:28:05,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:06,396 INFO L124 PetriNetUnfolderBase]: 2422/6861 cut-off events. [2025-03-13 22:28:06,396 INFO L125 PetriNetUnfolderBase]: For 1842/2195 co-relation queries the response was YES. [2025-03-13 22:28:06,414 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-13 22:28:06,442 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2025-03-13 22:28:06,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 1359 flow [2025-03-13 22:28:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2025-03-13 22:28:06,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9028985507246376 [2025-03-13 22:28:06,446 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 531 flow. Second operand 6 states and 623 transitions. [2025-03-13 22:28:06,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 1359 flow [2025-03-13 22:28:06,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:28:06,459 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2025-03-13 22:28:06,460 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-13 22:28:06,461 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2025-03-13 22:28:06,461 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2025-03-13 22:28:06,462 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-13 22:28:06,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:06,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:06,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:28:06,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:06,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -85106420, now seen corresponding path program 1 times [2025-03-13 22:28:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126502390] [2025-03-13 22:28:06,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:06,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:06,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:28:06,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:28:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126502390] [2025-03-13 22:28:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126502390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601349274] [2025-03-13 22:28:06,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:06,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:06,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:06,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115 [2025-03-13 22:28:06,789 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-13 22:28:06,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:06,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115 [2025-03-13 22:28:06,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:07,512 INFO L124 PetriNetUnfolderBase]: 3064/8850 cut-off events. [2025-03-13 22:28:07,512 INFO L125 PetriNetUnfolderBase]: For 6900/7199 co-relation queries the response was YES. [2025-03-13 22:28:07,542 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-13 22:28:07,578 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2025-03-13 22:28:07,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2025-03-13 22:28:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-03-13 22:28:07,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8463768115942029 [2025-03-13 22:28:07,580 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2025-03-13 22:28:07,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2025-03-13 22:28:07,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:07,609 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2025-03-13 22:28:07,609 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-13 22:28:07,610 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2025-03-13 22:28:07,611 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2025-03-13 22:28:07,611 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-13 22:28:07,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:07,611 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-13 22:28:07,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:28:07,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -268987459, now seen corresponding path program 1 times [2025-03-13 22:28:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962864379] [2025-03-13 22:28:07,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:07,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:28:07,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:28:07,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:07,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:07,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962864379] [2025-03-13 22:28:07,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962864379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:07,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:07,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:07,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14292558] [2025-03-13 22:28:07,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:07,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:07,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:07,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:08,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 115 [2025-03-13 22:28:08,391 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-13 22:28:08,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:08,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 115 [2025-03-13 22:28:08,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:09,521 INFO L124 PetriNetUnfolderBase]: 3384/9635 cut-off events. [2025-03-13 22:28:09,521 INFO L125 PetriNetUnfolderBase]: For 13100/13467 co-relation queries the response was YES. [2025-03-13 22:28:09,543 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-13 22:28:09,572 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 310 selfloop transitions, 36 changer transitions 0/430 dead transitions. [2025-03-13 22:28:09,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 430 transitions, 3901 flow [2025-03-13 22:28:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:28:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:28:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1074 transitions. [2025-03-13 22:28:09,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7183946488294315 [2025-03-13 22:28:09,575 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 1074 transitions. [2025-03-13 22:28:09,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 430 transitions, 3901 flow [2025-03-13 22:28:09,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 430 transitions, 3761 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:09,610 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2025-03-13 22:28:09,610 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-13 22:28:09,611 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2025-03-13 22:28:09,611 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2025-03-13 22:28:09,612 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-13 22:28:09,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:09,612 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-13 22:28:09,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:28:09,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:09,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1005912231, now seen corresponding path program 1 times [2025-03-13 22:28:09,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:09,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391311532] [2025-03-13 22:28:09,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:09,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:09,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:28:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:28:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:09,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391311532] [2025-03-13 22:28:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391311532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261009319] [2025-03-13 22:28:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:09,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:09,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:09,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:10,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-13 22:28:10,256 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-13 22:28:10,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:10,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-13 22:28:10,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:11,622 INFO L124 PetriNetUnfolderBase]: 5095/13018 cut-off events. [2025-03-13 22:28:11,622 INFO L125 PetriNetUnfolderBase]: For 18403/20350 co-relation queries the response was YES. [2025-03-13 22:28:11,654 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-13 22:28:11,691 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2025-03-13 22:28:11,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2025-03-13 22:28:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 22:28:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 22:28:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2025-03-13 22:28:11,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7695652173913043 [2025-03-13 22:28:11,695 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2025-03-13 22:28:11,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2025-03-13 22:28:11,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-13 22:28:11,750 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2025-03-13 22:28:11,751 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-13 22:28:11,751 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2025-03-13 22:28:11,751 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2025-03-13 22:28:11,751 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-13 22:28:11,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:11,752 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-13 22:28:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:28:11,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:11,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2039983165, now seen corresponding path program 1 times [2025-03-13 22:28:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:11,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238257082] [2025-03-13 22:28:11,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:11,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:28:11,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:28:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:12,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:12,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238257082] [2025-03-13 22:28:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238257082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:12,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:12,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376720565] [2025-03-13 22:28:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:12,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 115 [2025-03-13 22:28:12,399 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-13 22:28:12,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:12,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 115 [2025-03-13 22:28:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:13,963 INFO L124 PetriNetUnfolderBase]: 4491/12034 cut-off events. [2025-03-13 22:28:13,963 INFO L125 PetriNetUnfolderBase]: For 34179/34682 co-relation queries the response was YES. [2025-03-13 22:28:14,020 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-13 22:28:14,167 INFO L140 encePairwiseOnDemand]: 101/115 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2025-03-13 22:28:14,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2025-03-13 22:28:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:28:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:28:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2025-03-13 22:28:14,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7344481605351171 [2025-03-13 22:28:14,170 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2025-03-13 22:28:14,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2025-03-13 22:28:14,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:14,300 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2025-03-13 22:28:14,300 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-13 22:28:14,301 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2025-03-13 22:28:14,301 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2025-03-13 22:28:14,301 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-13 22:28:14,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:14,301 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-13 22:28:14,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:28:14,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:14,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -317404852, now seen corresponding path program 1 times [2025-03-13 22:28:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:14,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840791108] [2025-03-13 22:28:14,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:14,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 22:28:14,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 22:28:14,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:14,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:14,467 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-13 22:28:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840791108] [2025-03-13 22:28:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840791108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:14,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:14,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826684702] [2025-03-13 22:28:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:14,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:14,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:14,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:14,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2025-03-13 22:28:14,545 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-13 22:28:14,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:14,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2025-03-13 22:28:14,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:15,217 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-13 22:28:15,217 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2025-03-13 22:28:15,217 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-13 22:28:15,217 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-13 22:28:15,217 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-03-13 22:28:16,914 INFO L124 PetriNetUnfolderBase]: 9675/22073 cut-off events. [2025-03-13 22:28:16,914 INFO L125 PetriNetUnfolderBase]: For 74523/75412 co-relation queries the response was YES. [2025-03-13 22:28:17,013 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-13 22:28:17,085 INFO L140 encePairwiseOnDemand]: 96/115 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2025-03-13 22:28:17,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2025-03-13 22:28:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-03-13 22:28:17,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971014492753623 [2025-03-13 22:28:17,087 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2025-03-13 22:28:17,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2025-03-13 22:28:17,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-13 22:28:17,425 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2025-03-13 22:28:17,426 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-13 22:28:17,426 INFO L279 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2025-03-13 22:28:17,426 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2025-03-13 22:28:17,426 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-13 22:28:17,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:17,426 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:17,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:28:17,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:28:17,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1098564932, now seen corresponding path program 1 times [2025-03-13 22:28:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025817564] [2025-03-13 22:28:17,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:17,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:28:17,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:28:17,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:17,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:17,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:28:17,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:28:17,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:28:17,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:28:17,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:28:17,458 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-13 22:28:17,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-13 22:28:17,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-13 22:28:17,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-13 22:28:17,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-13 22:28:17,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:28:17,459 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:17,459 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:28:17,459 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:28:17,474 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:28:17,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 136 transitions, 299 flow [2025-03-13 22:28:17,613 INFO L124 PetriNetUnfolderBase]: 9/356 cut-off events. [2025-03-13 22:28:17,613 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2025-03-13 22:28:17,614 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-13 22:28:17,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 136 transitions, 299 flow [2025-03-13 22:28:17,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 136 transitions, 299 flow [2025-03-13 22:28:17,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:17,616 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;@28ff0942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:17,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-13 22:28:17,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:17,620 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2025-03-13 22:28:17,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:17,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:17,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:17,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1500251136, now seen corresponding path program 1 times [2025-03-13 22:28:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321982601] [2025-03-13 22:28:17,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:17,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 22:28:17,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 22:28:17,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321982601] [2025-03-13 22:28:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321982601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201844417] [2025-03-13 22:28:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:17,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:17,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:17,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:17,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-03-13 22:28:17,654 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-13 22:28:17,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:17,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-03-13 22:28:17,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:17,767 INFO L124 PetriNetUnfolderBase]: 90/1260 cut-off events. [2025-03-13 22:28:17,767 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2025-03-13 22:28:17,772 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-13 22:28:17,775 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-13 22:28:17,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2025-03-13 22:28:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-13 22:28:17,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9117647058823529 [2025-03-13 22:28:17,776 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 299 flow. Second operand 3 states and 372 transitions. [2025-03-13 22:28:17,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2025-03-13 22:28:17,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:17,778 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2025-03-13 22:28:17,778 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-13 22:28:17,779 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2025-03-13 22:28:17,779 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2025-03-13 22:28:17,779 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-13 22:28:17,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:17,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:17,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:28:17,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:17,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1269625815, now seen corresponding path program 1 times [2025-03-13 22:28:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:17,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885861094] [2025-03-13 22:28:17,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:17,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 22:28:17,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 22:28:17,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:17,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885861094] [2025-03-13 22:28:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885861094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271477688] [2025-03-13 22:28:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:17,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:17,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:17,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:17,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:17,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-03-13 22:28:17,811 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-13 22:28:17,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:17,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-03-13 22:28:17,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:18,009 INFO L124 PetriNetUnfolderBase]: 307/2452 cut-off events. [2025-03-13 22:28:18,009 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2025-03-13 22:28:18,017 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-13 22:28:18,022 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-03-13 22:28:18,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2025-03-13 22:28:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-13 22:28:18,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9142156862745098 [2025-03-13 22:28:18,024 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2025-03-13 22:28:18,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2025-03-13 22:28:18,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:18,027 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2025-03-13 22:28:18,027 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-13 22:28:18,028 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2025-03-13 22:28:18,028 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2025-03-13 22:28:18,028 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-13 22:28:18,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:18,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:18,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:28:18,028 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-13 22:28:18,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash -728964982, now seen corresponding path program 1 times [2025-03-13 22:28:18,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:18,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-03-13 22:28:18,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:18,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:18,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:18,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:18,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-03-13 22:28:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049930952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:18,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:18,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838936418] [2025-03-13 22:28:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:18,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:18,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:18,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 136 [2025-03-13 22:28:18,131 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-13 22:28:18,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:18,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 136 [2025-03-13 22:28:18,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:18,212 INFO L124 PetriNetUnfolderBase]: 50/854 cut-off events. [2025-03-13 22:28:18,212 INFO L125 PetriNetUnfolderBase]: For 85/133 co-relation queries the response was YES. [2025-03-13 22:28:18,215 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-13 22:28:18,216 INFO L140 encePairwiseOnDemand]: 128/136 looper letters, 16 selfloop transitions, 2 changer transitions 5/139 dead transitions. [2025-03-13 22:28:18,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 139 transitions, 371 flow [2025-03-13 22:28:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2025-03-13 22:28:18,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2025-03-13 22:28:18,218 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 732 transitions. [2025-03-13 22:28:18,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 139 transitions, 371 flow [2025-03-13 22:28:18,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:18,221 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 335 flow [2025-03-13 22:28:18,221 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-13 22:28:18,221 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 6 predicate places. [2025-03-13 22:28:18,221 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 335 flow [2025-03-13 22:28:18,221 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-13 22:28:18,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:18,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:28:18,222 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-13 22:28:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 319027544, now seen corresponding path program 1 times [2025-03-13 22:28:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692815405] [2025-03-13 22:28:18,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:18,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:18,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:18,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:18,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692815405] [2025-03-13 22:28:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692815405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504159106] [2025-03-13 22:28:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:18,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:18,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:18,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:18,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 136 [2025-03-13 22:28:18,477 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-13 22:28:18,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:18,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 136 [2025-03-13 22:28:18,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:20,502 INFO L124 PetriNetUnfolderBase]: 10321/23631 cut-off events. [2025-03-13 22:28:20,502 INFO L125 PetriNetUnfolderBase]: For 2020/2079 co-relation queries the response was YES. [2025-03-13 22:28:20,561 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-13 22:28:20,622 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 38 selfloop transitions, 54 changer transitions 0/189 dead transitions. [2025-03-13 22:28:20,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 641 flow [2025-03-13 22:28:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2025-03-13 22:28:20,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8406862745098039 [2025-03-13 22:28:20,623 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 335 flow. Second operand 6 states and 686 transitions. [2025-03-13 22:28:20,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 641 flow [2025-03-13 22:28:20,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 189 transitions, 629 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 22:28:20,631 INFO L231 Difference]: Finished difference. Result has 148 places, 187 transitions, 681 flow [2025-03-13 22:28:20,631 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-13 22:28:20,631 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 9 predicate places. [2025-03-13 22:28:20,631 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 681 flow [2025-03-13 22:28:20,632 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-13 22:28:20,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:20,632 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-13 22:28:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:28:20,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash -605889973, now seen corresponding path program 1 times [2025-03-13 22:28:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316396252] [2025-03-13 22:28:20,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:20,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:28:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:28:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316396252] [2025-03-13 22:28:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316396252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:20,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:20,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292122399] [2025-03-13 22:28:20,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:20,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:20,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:20,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 136 [2025-03-13 22:28:20,874 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-13 22:28:20,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:20,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 136 [2025-03-13 22:28:20,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:23,751 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-13 22:28:23,751 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-13 22:28:23,751 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:23,751 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:23,751 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:23,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|)), 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-13 22:28:23,939 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-13 22:28:23,939 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:23,939 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:23,939 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:24,073 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-13 22:28:24,074 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-13 22:28:24,074 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:24,074 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:24,074 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:24,105 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-13 22:28:24,105 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-13 22:28:24,105 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:24,105 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:24,105 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:25,361 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-13 22:28:25,361 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-13 22:28:25,361 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:25,361 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:25,361 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:26,207 INFO L124 PetriNetUnfolderBase]: 29118/67432 cut-off events. [2025-03-13 22:28:26,207 INFO L125 PetriNetUnfolderBase]: For 19553/23106 co-relation queries the response was YES. [2025-03-13 22:28:26,505 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-13 22:28:26,736 INFO L140 encePairwiseOnDemand]: 113/136 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2025-03-13 22:28:26,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 349 transitions, 1945 flow [2025-03-13 22:28:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2025-03-13 22:28:26,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105392156862745 [2025-03-13 22:28:26,741 INFO L175 Difference]: Start difference. First operand has 148 places, 187 transitions, 681 flow. Second operand 6 states and 743 transitions. [2025-03-13 22:28:26,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 349 transitions, 1945 flow [2025-03-13 22:28:27,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:27,012 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2025-03-13 22:28:27,012 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-13 22:28:27,013 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2025-03-13 22:28:27,013 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2025-03-13 22:28:27,013 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-13 22:28:27,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:27,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:27,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:28:27,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:27,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1306025561, now seen corresponding path program 1 times [2025-03-13 22:28:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:27,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-03-13 22:28:27,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:27,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 22:28:27,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 22:28:27,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:27,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542202469] [2025-03-13 22:28:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542202469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90156080] [2025-03-13 22:28:27,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:27,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 136 [2025-03-13 22:28:27,230 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-13 22:28:27,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:27,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 136 [2025-03-13 22:28:27,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:35,230 INFO L124 PetriNetUnfolderBase]: 35372/83044 cut-off events. [2025-03-13 22:28:35,230 INFO L125 PetriNetUnfolderBase]: For 74381/76862 co-relation queries the response was YES. [2025-03-13 22:28:35,671 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-13 22:28:36,098 INFO L140 encePairwiseOnDemand]: 117/136 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2025-03-13 22:28:36,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2025-03-13 22:28:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2025-03-13 22:28:36,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-13 22:28:36,100 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2025-03-13 22:28:36,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2025-03-13 22:28:36,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:36,613 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2025-03-13 22:28:36,613 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-13 22:28:36,613 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2025-03-13 22:28:36,613 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2025-03-13 22:28:36,613 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-13 22:28:36,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:36,614 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-13 22:28:36,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:28:36,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-13 22:28:36,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash -897530460, now seen corresponding path program 1 times [2025-03-13 22:28:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:36,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186898954] [2025-03-13 22:28:36,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:36,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:28:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:28:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:36,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186898954] [2025-03-13 22:28:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186898954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:28:36,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401694507] [2025-03-13 22:28:36,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:36,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:28:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:36,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:28:36,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:28:37,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 136 [2025-03-13 22:28:37,260 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-13 22:28:37,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:37,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 136 [2025-03-13 22:28:37,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:42,504 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-13 22:28:42,505 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-13 22:28:42,505 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:42,505 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:42,505 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:43,843 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-13 22:28:43,844 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-13 22:28:43,844 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:43,844 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:43,844 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:44,619 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-13 22:28:44,619 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-13 22:28:44,619 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:44,619 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:44,619 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:44,921 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-13 22:28:44,921 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is not cut-off event [2025-03-13 22:28:44,921 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:28:44,921 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:28:44,921 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is not cut-off event [2025-03-13 22:28:47,033 INFO L124 PetriNetUnfolderBase]: 39328/91205 cut-off events. [2025-03-13 22:28:47,033 INFO L125 PetriNetUnfolderBase]: For 149368/154298 co-relation queries the response was YES. [2025-03-13 22:28:47,646 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-13 22:28:48,022 INFO L140 encePairwiseOnDemand]: 122/136 looper letters, 495 selfloop transitions, 36 changer transitions 0/630 dead transitions. [2025-03-13 22:28:48,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 630 transitions, 6073 flow [2025-03-13 22:28:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:28:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:28:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1299 transitions. [2025-03-13 22:28:48,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7347285067873304 [2025-03-13 22:28:48,024 INFO L175 Difference]: Start difference. First operand has 167 places, 409 transitions, 2981 flow. Second operand 13 states and 1299 transitions. [2025-03-13 22:28:48,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 630 transitions, 6073 flow [2025-03-13 22:28:48,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 630 transitions, 5849 flow, removed 112 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:48,611 INFO L231 Difference]: Finished difference. Result has 178 places, 408 transitions, 2825 flow [2025-03-13 22:28:48,612 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-13 22:28:48,612 INFO L279 CegarLoopForPetriNet]: 139 programPoint places, 39 predicate places. [2025-03-13 22:28:48,612 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 408 transitions, 2825 flow [2025-03-13 22:28:48,613 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-13 22:28:48,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:48,613 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-13 22:28:48,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:28:48,613 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-13 22:28:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2104610856, now seen corresponding path program 1 times [2025-03-13 22:28:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:48,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882378963] [2025-03-13 22:28:48,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:48,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:48,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:28:48,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:28:48,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:48,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat