./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:28:52,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:28:52,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:28:52,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:28:52,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:28:52,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:28:52,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:28:52,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:28:52,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:28:52,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:28:52,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:28:52,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:28:52,685 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:28:52,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:28:52,686 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:28:52,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:28:52,687 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:28:52,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:28:52,687 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:28:52,687 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:28:52,687 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:28:52,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:28:52,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:28:52,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:28:52,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:28:52,689 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2025-03-13 22:28:52,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:28:52,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:28:52,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:28:52,940 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:28:52,940 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:28:52,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-03-13 22:28:54,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d8c43f24/e648bd1c4daa4ddd8f7604380fb1097e/FLAG36a488e0a [2025-03-13 22:28:54,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:28:54,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-03-13 22:28:54,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d8c43f24/e648bd1c4daa4ddd8f7604380fb1097e/FLAG36a488e0a [2025-03-13 22:28:54,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d8c43f24/e648bd1c4daa4ddd8f7604380fb1097e [2025-03-13 22:28:54,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:28:54,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:28:54,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:54,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:28:54,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:28:54,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:54" (1/1) ... [2025-03-13 22:28:54,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:54, skipping insertion in model container [2025-03-13 22:28:54,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:28:54" (1/1) ... [2025-03-13 22:28:54,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:28:54,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:54,906 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:28:54,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:28:54,987 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:28:54,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:54 WrapperNode [2025-03-13 22:28:54,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:28:54,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:54,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:28:54,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:28:54,994 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:54" (1/1) ... [2025-03-13 22:28:55,012 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:54" (1/1) ... [2025-03-13 22:28:55,028 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2025-03-13 22:28:55,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:28:55,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:28:55,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:28:55,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:28:55,034 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:54" (1/1) ... [2025-03-13 22:28:55,034 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:54" (1/1) ... [2025-03-13 22:28:55,036 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:54" (1/1) ... [2025-03-13 22:28:55,036 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:54" (1/1) ... [2025-03-13 22:28:55,041 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:54" (1/1) ... [2025-03-13 22:28:55,042 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:54" (1/1) ... [2025-03-13 22:28:55,043 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:54" (1/1) ... [2025-03-13 22:28:55,044 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:54" (1/1) ... [2025-03-13 22:28:55,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:28:55,051 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:28:55,051 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:28:55,051 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:28:55,051 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:54" (1/1) ... [2025-03-13 22:28:55,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:28:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:28:55,084 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:55,087 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:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:28:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:28:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:28:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:28:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:28:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:28:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:28:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:28:55,109 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:55,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:28:55,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:28:55,550 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:28:55,552 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:28:55,552 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:28:55,590 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-13 22:28:55,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:55 BoogieIcfgContainer [2025-03-13 22:28:55,591 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:28:55,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:28:55,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:28:55,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:28:55,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:28:54" (1/3) ... [2025-03-13 22:28:55,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269108c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:55, skipping insertion in model container [2025-03-13 22:28:55,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:28:54" (2/3) ... [2025-03-13 22:28:55,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269108c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:28:55, skipping insertion in model container [2025-03-13 22:28:55,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:55" (3/3) ... [2025-03-13 22:28:55,598 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2025-03-13 22:28:55,610 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:28:55,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-bitmask-race.i that has 2 procedures, 169 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-03-13 22:28:55,612 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:28:55,682 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:28:55,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 185 transitions, 377 flow [2025-03-13 22:28:55,817 INFO L124 PetriNetUnfolderBase]: 26/277 cut-off events. [2025-03-13 22:28:55,823 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:28:55,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 277 events. 26/277 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 622 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 140. Up to 6 conditions per place. [2025-03-13 22:28:55,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 185 transitions, 377 flow [2025-03-13 22:28:55,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 185 transitions, 377 flow [2025-03-13 22:28:55,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:28:55,855 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;@35837e31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:28:55,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:28:55,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:28:55,867 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-13 22:28:55,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:28:55,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:55,869 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] [2025-03-13 22:28:55,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 174643554, now seen corresponding path program 1 times [2025-03-13 22:28:55,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:55,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645484495] [2025-03-13 22:28:55,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:55,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:28:55,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:28:55,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:55,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:28:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:56,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645484495] [2025-03-13 22:28:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645484495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:56,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562401806] [2025-03-13 22:28:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:56,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:56,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:56,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:56,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-03-13 22:28:56,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 185 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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:56,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:56,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-03-13 22:28:56,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:56,205 INFO L124 PetriNetUnfolderBase]: 62/554 cut-off events. [2025-03-13 22:28:56,205 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-13 22:28:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 554 events. 62/554 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2343 event pairs, 2 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 469. Up to 65 conditions per place. [2025-03-13 22:28:56,210 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 2 changer transitions 2/182 dead transitions. [2025-03-13 22:28:56,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 182 transitions, 407 flow [2025-03-13 22:28:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2025-03-13 22:28:56,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2025-03-13 22:28:56,225 INFO L175 Difference]: Start difference. First operand has 172 places, 185 transitions, 377 flow. Second operand 3 states and 513 transitions. [2025-03-13 22:28:56,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 182 transitions, 407 flow [2025-03-13 22:28:56,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 182 transitions, 407 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:56,231 INFO L231 Difference]: Finished difference. Result has 173 places, 180 transitions, 371 flow [2025-03-13 22:28:56,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=173, PETRI_TRANSITIONS=180} [2025-03-13 22:28:56,238 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2025-03-13 22:28:56,238 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 180 transitions, 371 flow [2025-03-13 22:28:56,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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:56,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:56,239 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:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:28:56,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:56,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:56,240 INFO L85 PathProgramCache]: Analyzing trace with hash -460911825, now seen corresponding path program 1 times [2025-03-13 22:28:56,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:56,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504159106] [2025-03-13 22:28:56,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:56,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:56,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:28:56,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:28:56,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:56,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:56,314 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:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:56,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504159106] [2025-03-13 22:28:56,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504159106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306119450] [2025-03-13 22:28:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:56,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:56,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-03-13 22:28:56,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 180 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:56,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:56,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-03-13 22:28:56,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:56,444 INFO L124 PetriNetUnfolderBase]: 132/715 cut-off events. [2025-03-13 22:28:56,444 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:28:56,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 715 events. 132/715 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3524 event pairs, 6 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 843. Up to 106 conditions per place. [2025-03-13 22:28:56,448 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 29 selfloop transitions, 8 changer transitions 0/196 dead transitions. [2025-03-13 22:28:56,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 196 transitions, 477 flow [2025-03-13 22:28:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-03-13 22:28:56,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477477477477477 [2025-03-13 22:28:56,451 INFO L175 Difference]: Start difference. First operand has 173 places, 180 transitions, 371 flow. Second operand 3 states and 526 transitions. [2025-03-13 22:28:56,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 196 transitions, 477 flow [2025-03-13 22:28:56,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 196 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:56,455 INFO L231 Difference]: Finished difference. Result has 173 places, 188 transitions, 437 flow [2025-03-13 22:28:56,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=173, PETRI_TRANSITIONS=188} [2025-03-13 22:28:56,456 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2025-03-13 22:28:56,456 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 188 transitions, 437 flow [2025-03-13 22:28:56,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:56,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:56,456 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] [2025-03-13 22:28:56,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:28:56,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:56,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 766686491, now seen corresponding path program 1 times [2025-03-13 22:28:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305266305] [2025-03-13 22:28:56,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:56,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 22:28:56,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 22:28:56,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:56,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:56,520 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:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305266305] [2025-03-13 22:28:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305266305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:56,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682327284] [2025-03-13 22:28:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:56,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:56,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:56,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:56,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 185 [2025-03-13 22:28:56,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 188 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:56,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:56,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 185 [2025-03-13 22:28:56,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:56,691 INFO L124 PetriNetUnfolderBase]: 118/819 cut-off events. [2025-03-13 22:28:56,691 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-13 22:28:56,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 819 events. 118/819 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4406 event pairs, 12 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 849. Up to 73 conditions per place. [2025-03-13 22:28:56,696 INFO L140 encePairwiseOnDemand]: 181/185 looper letters, 21 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-03-13 22:28:56,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 194 transitions, 495 flow [2025-03-13 22:28:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:56,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-03-13 22:28:56,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423423423423424 [2025-03-13 22:28:56,699 INFO L175 Difference]: Start difference. First operand has 173 places, 188 transitions, 437 flow. Second operand 3 states and 523 transitions. [2025-03-13 22:28:56,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 194 transitions, 495 flow [2025-03-13 22:28:56,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 194 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:56,703 INFO L231 Difference]: Finished difference. Result has 172 places, 188 transitions, 431 flow [2025-03-13 22:28:56,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=172, PETRI_TRANSITIONS=188} [2025-03-13 22:28:56,706 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 0 predicate places. [2025-03-13 22:28:56,707 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 188 transitions, 431 flow [2025-03-13 22:28:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:56,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:56,707 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] [2025-03-13 22:28:56,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:28:56,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash -136971484, now seen corresponding path program 1 times [2025-03-13 22:28:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751915232] [2025-03-13 22:28:56,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:28:56,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:28:56,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:56,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:56,858 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:56,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:56,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751915232] [2025-03-13 22:28:56,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751915232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196687640] [2025-03-13 22:28:56,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:56,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:28:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:56,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:28:56,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:28:56,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-03-13 22:28:56,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 188 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 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:56,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:56,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-03-13 22:28:56,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:57,025 INFO L124 PetriNetUnfolderBase]: 109/712 cut-off events. [2025-03-13 22:28:57,026 INFO L125 PetriNetUnfolderBase]: For 25/40 co-relation queries the response was YES. [2025-03-13 22:28:57,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 712 events. 109/712 cut-off events. For 25/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3658 event pairs, 15 based on Foata normal form. 2/601 useless extension candidates. Maximal degree in co-relation 711. Up to 83 conditions per place. [2025-03-13 22:28:57,029 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 27 selfloop transitions, 2 changer transitions 5/201 dead transitions. [2025-03-13 22:28:57,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 201 transitions, 525 flow [2025-03-13 22:28:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2025-03-13 22:28:57,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9072072072072072 [2025-03-13 22:28:57,031 INFO L175 Difference]: Start difference. First operand has 172 places, 188 transitions, 431 flow. Second operand 6 states and 1007 transitions. [2025-03-13 22:28:57,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 201 transitions, 525 flow [2025-03-13 22:28:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 201 transitions, 525 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:57,034 INFO L231 Difference]: Finished difference. Result has 181 places, 188 transitions, 449 flow [2025-03-13 22:28:57,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=449, PETRI_PLACES=181, PETRI_TRANSITIONS=188} [2025-03-13 22:28:57,034 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2025-03-13 22:28:57,035 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 188 transitions, 449 flow [2025-03-13 22:28:57,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 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:57,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:57,035 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] [2025-03-13 22:28:57,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:28:57,035 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:57,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:57,036 INFO L85 PathProgramCache]: Analyzing trace with hash 195838961, now seen corresponding path program 1 times [2025-03-13 22:28:57,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:57,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159524967] [2025-03-13 22:28:57,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:57,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:28:57,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:28:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:57,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:57,111 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:57,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159524967] [2025-03-13 22:28:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159524967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:57,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:57,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:28:57,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597766605] [2025-03-13 22:28:57,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:57,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:57,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:57,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:57,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:57,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 185 [2025-03-13 22:28:57,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 188 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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:57,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:57,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 185 [2025-03-13 22:28:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:57,213 INFO L124 PetriNetUnfolderBase]: 110/657 cut-off events. [2025-03-13 22:28:57,213 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:28:57,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 657 events. 110/657 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3024 event pairs, 12 based on Foata normal form. 1/556 useless extension candidates. Maximal degree in co-relation 767. Up to 87 conditions per place. [2025-03-13 22:28:57,217 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 19 selfloop transitions, 2 changer transitions 0/195 dead transitions. [2025-03-13 22:28:57,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 195 transitions, 505 flow [2025-03-13 22:28:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:57,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-03-13 22:28:57,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9531531531531532 [2025-03-13 22:28:57,219 INFO L175 Difference]: Start difference. First operand has 181 places, 188 transitions, 449 flow. Second operand 3 states and 529 transitions. [2025-03-13 22:28:57,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 195 transitions, 505 flow [2025-03-13 22:28:57,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 195 transitions, 491 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:28:57,223 INFO L231 Difference]: Finished difference. Result has 176 places, 189 transitions, 447 flow [2025-03-13 22:28:57,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=176, PETRI_TRANSITIONS=189} [2025-03-13 22:28:57,224 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 4 predicate places. [2025-03-13 22:28:57,224 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 189 transitions, 447 flow [2025-03-13 22:28:57,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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:57,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:57,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:57,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:28:57,225 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2103500080, now seen corresponding path program 1 times [2025-03-13 22:28:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259311735] [2025-03-13 22:28:57,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:28:57,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:28:57,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:57,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:57,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:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259311735] [2025-03-13 22:28:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259311735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:57,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:57,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:28:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993900987] [2025-03-13 22:28:57,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:57,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:28:57,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:57,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:28:57,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:28:57,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-03-13 22:28:57,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 189 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:57,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:57,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-03-13 22:28:57,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:57,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 44#L1058-24true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true, 158#L1048-5true]) [2025-03-13 22:28:57,440 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is not cut-off event [2025-03-13 22:28:57,441 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is not cut-off event [2025-03-13 22:28:57,441 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-13 22:28:57,441 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-13 22:28:57,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 2#L1058-22true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true, 158#L1048-5true]) [2025-03-13 22:28:57,446 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-03-13 22:28:57,446 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-03-13 22:28:57,446 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-13 22:28:57,446 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is not cut-off event [2025-03-13 22:28:57,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 105#L1058-12true, 173#true, 202#true, 158#L1048-5true]) [2025-03-13 22:28:57,461 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-13 22:28:57,461 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:57,462 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-13 22:28:57,462 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:57,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][192], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 11#L1058-10true, 198#true, Black: 183#true, 173#true, 202#true, 158#L1048-5true]) [2025-03-13 22:28:57,465 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-13 22:28:57,465 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:57,465 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:57,465 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:57,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][176], [69#L1059-10true, Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 198#true, Black: 183#true, 173#true, 202#true, 158#L1048-5true]) [2025-03-13 22:28:57,475 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is not cut-off event [2025-03-13 22:28:57,475 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-03-13 22:28:57,476 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is not cut-off event [2025-03-13 22:28:57,476 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-03-13 22:28:57,491 INFO L124 PetriNetUnfolderBase]: 287/1192 cut-off events. [2025-03-13 22:28:57,491 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 22:28:57,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 1192 events. 287/1192 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7061 event pairs, 29 based on Foata normal form. 1/1045 useless extension candidates. Maximal degree in co-relation 1539. Up to 172 conditions per place. [2025-03-13 22:28:57,495 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 42 selfloop transitions, 12 changer transitions 0/218 dead transitions. [2025-03-13 22:28:57,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 218 transitions, 615 flow [2025-03-13 22:28:57,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 22:28:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 22:28:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2025-03-13 22:28:57,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337837837837838 [2025-03-13 22:28:57,497 INFO L175 Difference]: Start difference. First operand has 176 places, 189 transitions, 447 flow. Second operand 4 states and 691 transitions. [2025-03-13 22:28:57,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 218 transitions, 615 flow [2025-03-13 22:28:57,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 218 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:28:57,500 INFO L231 Difference]: Finished difference. Result has 181 places, 199 transitions, 537 flow [2025-03-13 22:28:57,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=537, PETRI_PLACES=181, PETRI_TRANSITIONS=199} [2025-03-13 22:28:57,501 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 9 predicate places. [2025-03-13 22:28:57,501 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 199 transitions, 537 flow [2025-03-13 22:28:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:57,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:57,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:28:57,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1519743973, now seen corresponding path program 1 times [2025-03-13 22:28:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406349865] [2025-03-13 22:28:57,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:57,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:28:57,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:28:57,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:57,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:57,566 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:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406349865] [2025-03-13 22:28:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406349865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:57,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:28:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516237181] [2025-03-13 22:28:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:57,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:28:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:57,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:28:57,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:28:57,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-03-13 22:28:57,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 199 transitions, 537 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:57,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:57,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-03-13 22:28:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:57,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 44#L1058-24true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true]) [2025-03-13 22:28:57,682 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-03-13 22:28:57,682 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 22:28:57,682 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-13 22:28:57,682 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 22:28:57,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), 2#L1058-22true, Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true]) [2025-03-13 22:28:57,685 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-03-13 22:28:57,685 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 22:28:57,686 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-03-13 22:28:57,686 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2025-03-13 22:28:57,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 53#L1058-18true, 173#true, 202#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 209#true, 158#L1048-5true]) [2025-03-13 22:28:57,693 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-03-13 22:28:57,693 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-13 22:28:57,693 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-13 22:28:57,693 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-03-13 22:28:57,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 105#L1058-12true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true]) [2025-03-13 22:28:57,705 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-03-13 22:28:57,705 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:57,705 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-13 22:28:57,705 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:57,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][191], [Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 11#L1058-10true, Black: 183#true, 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 202#true, 209#true, 158#L1048-5true]) [2025-03-13 22:28:57,708 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-03-13 22:28:57,708 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:57,710 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-13 22:28:57,711 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-13 22:28:57,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][174], [69#L1059-10true, Black: 204#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 185#(= |#race~datas~0| 0), Black: 178#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 183#true, 173#true, 202#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true]) [2025-03-13 22:28:57,727 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-03-13 22:28:57,727 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-03-13 22:28:57,727 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:57,727 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:57,752 INFO L124 PetriNetUnfolderBase]: 284/1193 cut-off events. [2025-03-13 22:28:57,752 INFO L125 PetriNetUnfolderBase]: For 388/452 co-relation queries the response was YES. [2025-03-13 22:28:57,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 1193 events. 284/1193 cut-off events. For 388/452 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7146 event pairs, 29 based on Foata normal form. 21/1076 useless extension candidates. Maximal degree in co-relation 1823. Up to 169 conditions per place. [2025-03-13 22:28:57,763 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 42 selfloop transitions, 13 changer transitions 0/219 dead transitions. [2025-03-13 22:28:57,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 219 transitions, 701 flow [2025-03-13 22:28:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 22:28:57,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 22:28:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2025-03-13 22:28:57,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9310810810810811 [2025-03-13 22:28:57,765 INFO L175 Difference]: Start difference. First operand has 181 places, 199 transitions, 537 flow. Second operand 4 states and 689 transitions. [2025-03-13 22:28:57,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 219 transitions, 701 flow [2025-03-13 22:28:57,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 219 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:57,771 INFO L231 Difference]: Finished difference. Result has 186 places, 202 transitions, 596 flow [2025-03-13 22:28:57,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=596, PETRI_PLACES=186, PETRI_TRANSITIONS=202} [2025-03-13 22:28:57,771 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 14 predicate places. [2025-03-13 22:28:57,771 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 596 flow [2025-03-13 22:28:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:57,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:57,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:28:57,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:57,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -594432910, now seen corresponding path program 1 times [2025-03-13 22:28:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:57,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016179794] [2025-03-13 22:28:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:57,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:28:57,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:28:57,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:57,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:57,845 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:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016179794] [2025-03-13 22:28:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016179794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:57,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:57,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:28:57,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150488530] [2025-03-13 22:28:57,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:57,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:28:57,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:57,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:28:57,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:28:57,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-03-13 22:28:57,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 202 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:57,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:57,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-03-13 22:28:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:58,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][174], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 209#true, 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 69#L1059-10true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, 202#true]) [2025-03-13 22:28:58,028 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2025-03-13 22:28:58,028 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:58,028 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:58,028 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2025-03-13 22:28:58,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][174], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 161#L1058-2true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 178#true, Black: 183#true, 202#true]) [2025-03-13 22:28:58,029 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,029 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,029 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,029 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, 173#true, 215#true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, 202#true]) [2025-03-13 22:28:58,034 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,034 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:28:58,034 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-13 22:28:58,034 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][168], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 87#L1059-1true, 209#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, 202#true]) [2025-03-13 22:28:58,046 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2025-03-13 22:28:58,046 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-13 22:28:58,046 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-13 22:28:58,046 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-13 22:28:58,058 INFO L124 PetriNetUnfolderBase]: 315/1318 cut-off events. [2025-03-13 22:28:58,058 INFO L125 PetriNetUnfolderBase]: For 944/1026 co-relation queries the response was YES. [2025-03-13 22:28:58,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1318 events. 315/1318 cut-off events. For 944/1026 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8050 event pairs, 33 based on Foata normal form. 20/1180 useless extension candidates. Maximal degree in co-relation 2264. Up to 216 conditions per place. [2025-03-13 22:28:58,064 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 39 selfloop transitions, 15 changer transitions 0/221 dead transitions. [2025-03-13 22:28:58,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 221 transitions, 771 flow [2025-03-13 22:28:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 22:28:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 22:28:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2025-03-13 22:28:58,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283783783783783 [2025-03-13 22:28:58,066 INFO L175 Difference]: Start difference. First operand has 186 places, 202 transitions, 596 flow. Second operand 4 states and 687 transitions. [2025-03-13 22:28:58,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 221 transitions, 771 flow [2025-03-13 22:28:58,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 221 transitions, 755 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 22:28:58,072 INFO L231 Difference]: Finished difference. Result has 190 places, 206 transitions, 663 flow [2025-03-13 22:28:58,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=663, PETRI_PLACES=190, PETRI_TRANSITIONS=206} [2025-03-13 22:28:58,075 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 18 predicate places. [2025-03-13 22:28:58,075 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 206 transitions, 663 flow [2025-03-13 22:28:58,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:58,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:58,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:58,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:28:58,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:58,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash -37991475, now seen corresponding path program 1 times [2025-03-13 22:28:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384519333] [2025-03-13 22:28:58,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:58,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:28:58,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:28:58,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:58,171 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:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:58,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384519333] [2025-03-13 22:28:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384519333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:58,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:58,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:28:58,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504583729] [2025-03-13 22:28:58,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:58,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:28:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:58,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:28:58,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:28:58,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-03-13 22:28:58,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 206 transitions, 663 flow. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:58,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:58,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-03-13 22:28:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:58,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][172], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 69#L1059-10true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,340 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-03-13 22:28:58,340 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:28:58,340 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-03-13 22:28:58,340 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-03-13 22:28:58,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][172], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 161#L1058-2true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 215#true, 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,343 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-13 22:28:58,343 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:28:58,343 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,343 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][166], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, 173#true, 215#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,349 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,349 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,349 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,349 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][166], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, 215#true, 87#L1059-1true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 180#(= |#race~threads_mask~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,377 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-03-13 22:28:58,377 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-13 22:28:58,377 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-13 22:28:58,377 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-13 22:28:58,390 INFO L124 PetriNetUnfolderBase]: 325/1333 cut-off events. [2025-03-13 22:28:58,391 INFO L125 PetriNetUnfolderBase]: For 1592/1684 co-relation queries the response was YES. [2025-03-13 22:28:58,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 1333 events. 325/1333 cut-off events. For 1592/1684 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8188 event pairs, 35 based on Foata normal form. 21/1193 useless extension candidates. Maximal degree in co-relation 2509. Up to 222 conditions per place. [2025-03-13 22:28:58,397 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 39 selfloop transitions, 17 changer transitions 0/223 dead transitions. [2025-03-13 22:28:58,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 223 transitions, 835 flow [2025-03-13 22:28:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 22:28:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 22:28:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2025-03-13 22:28:58,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283783783783783 [2025-03-13 22:28:58,399 INFO L175 Difference]: Start difference. First operand has 190 places, 206 transitions, 663 flow. Second operand 4 states and 687 transitions. [2025-03-13 22:28:58,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 223 transitions, 835 flow [2025-03-13 22:28:58,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 223 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:28:58,405 INFO L231 Difference]: Finished difference. Result has 194 places, 209 transitions, 729 flow [2025-03-13 22:28:58,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=729, PETRI_PLACES=194, PETRI_TRANSITIONS=209} [2025-03-13 22:28:58,406 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 22 predicate places. [2025-03-13 22:28:58,406 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 209 transitions, 729 flow [2025-03-13 22:28:58,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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:58,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:58,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:58,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:28:58,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:58,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 573872452, now seen corresponding path program 1 times [2025-03-13 22:28:58,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:58,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339391555] [2025-03-13 22:28:58,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:58,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:28:58,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:28:58,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:58,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:58,490 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:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339391555] [2025-03-13 22:28:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339391555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:58,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:28:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470308682] [2025-03-13 22:28:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:28:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:58,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:28:58,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:28:58,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-03-13 22:28:58,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 209 transitions, 729 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 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:58,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:58,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-03-13 22:28:58,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:58,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 161#L1058-2true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 178#true, 221#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,666 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,666 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,666 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:28:58,666 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:28:58,697 INFO L124 PetriNetUnfolderBase]: 380/1509 cut-off events. [2025-03-13 22:28:58,697 INFO L125 PetriNetUnfolderBase]: For 2983/3112 co-relation queries the response was YES. [2025-03-13 22:28:58,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 1509 events. 380/1509 cut-off events. For 2983/3112 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9768 event pairs, 31 based on Foata normal form. 18/1349 useless extension candidates. Maximal degree in co-relation 3224. Up to 341 conditions per place. [2025-03-13 22:28:58,705 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 44 selfloop transitions, 18 changer transitions 0/238 dead transitions. [2025-03-13 22:28:58,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 238 transitions, 1043 flow [2025-03-13 22:28:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 22:28:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 22:28:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2025-03-13 22:28:58,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9351351351351351 [2025-03-13 22:28:58,708 INFO L175 Difference]: Start difference. First operand has 194 places, 209 transitions, 729 flow. Second operand 4 states and 692 transitions. [2025-03-13 22:28:58,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 238 transitions, 1043 flow [2025-03-13 22:28:58,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 238 transitions, 1019 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:28:58,713 INFO L231 Difference]: Finished difference. Result has 198 places, 223 transitions, 925 flow [2025-03-13 22:28:58,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=925, PETRI_PLACES=198, PETRI_TRANSITIONS=223} [2025-03-13 22:28:58,714 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 26 predicate places. [2025-03-13 22:28:58,714 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 223 transitions, 925 flow [2025-03-13 22:28:58,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 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:58,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:58,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:58,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:28:58,715 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:58,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 581260620, now seen corresponding path program 1 times [2025-03-13 22:28:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606263075] [2025-03-13 22:28:58,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:58,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-13 22:28:58,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-13 22:28:58,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:58,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:58,749 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:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606263075] [2025-03-13 22:28:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606263075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:28:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465203907] [2025-03-13 22:28:58,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:58,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:28:58,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:58,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:28:58,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:28:58,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2025-03-13 22:28:58,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 223 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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:58,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:58,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2025-03-13 22:28:58,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:58,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][167], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 235#true, 161#L1058-2true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 178#true, Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,856 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,856 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:28:58,856 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-13 22:28:58,856 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][207], [Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 223#(not (= ~threads_mask~0 0)), 235#true, Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 227#true, 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 178#true, Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 183#true, Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true]) [2025-03-13 22:28:58,864 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:28:58,864 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,864 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:28:58,913 INFO L124 PetriNetUnfolderBase]: 383/1700 cut-off events. [2025-03-13 22:28:58,913 INFO L125 PetriNetUnfolderBase]: For 2336/2400 co-relation queries the response was YES. [2025-03-13 22:28:58,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 1700 events. 383/1700 cut-off events. For 2336/2400 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 12544 event pairs, 53 based on Foata normal form. 9/1511 useless extension candidates. Maximal degree in co-relation 3235. Up to 318 conditions per place. [2025-03-13 22:28:58,924 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 30 selfloop transitions, 7 changer transitions 0/230 dead transitions. [2025-03-13 22:28:58,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 230 transitions, 1019 flow [2025-03-13 22:28:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:28:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:28:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-13 22:28:58,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2025-03-13 22:28:58,930 INFO L175 Difference]: Start difference. First operand has 198 places, 223 transitions, 925 flow. Second operand 3 states and 514 transitions. [2025-03-13 22:28:58,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 230 transitions, 1019 flow [2025-03-13 22:28:58,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 230 transitions, 1019 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:28:58,939 INFO L231 Difference]: Finished difference. Result has 202 places, 228 transitions, 981 flow [2025-03-13 22:28:58,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=981, PETRI_PLACES=202, PETRI_TRANSITIONS=228} [2025-03-13 22:28:58,940 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 30 predicate places. [2025-03-13 22:28:58,940 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 228 transitions, 981 flow [2025-03-13 22:28:58,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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:58,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:58,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:58,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:28:58,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:58,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -999753541, now seen corresponding path program 1 times [2025-03-13 22:28:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:58,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386237735] [2025-03-13 22:28:58,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:58,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:28:58,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:28:58,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:58,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:59,262 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:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:59,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386237735] [2025-03-13 22:28:59,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386237735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:59,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:59,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117368501] [2025-03-13 22:28:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:59,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:59,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:59,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:59,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2025-03-13 22:28:59,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 228 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 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:59,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:59,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2025-03-13 22:28:59,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:28:59,613 INFO L124 PetriNetUnfolderBase]: 524/2287 cut-off events. [2025-03-13 22:28:59,613 INFO L125 PetriNetUnfolderBase]: For 2563/2585 co-relation queries the response was YES. [2025-03-13 22:28:59,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 2287 events. 524/2287 cut-off events. For 2563/2585 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17339 event pairs, 101 based on Foata normal form. 8/2010 useless extension candidates. Maximal degree in co-relation 4287. Up to 433 conditions per place. [2025-03-13 22:28:59,625 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 43 selfloop transitions, 22 changer transitions 0/257 dead transitions. [2025-03-13 22:28:59,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 257 transitions, 1169 flow [2025-03-13 22:28:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:28:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:28:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2025-03-13 22:28:59,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2025-03-13 22:28:59,630 INFO L175 Difference]: Start difference. First operand has 202 places, 228 transitions, 981 flow. Second operand 6 states and 968 transitions. [2025-03-13 22:28:59,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 257 transitions, 1169 flow [2025-03-13 22:28:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 257 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:28:59,640 INFO L231 Difference]: Finished difference. Result has 210 places, 249 transitions, 1117 flow [2025-03-13 22:28:59,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1117, PETRI_PLACES=210, PETRI_TRANSITIONS=249} [2025-03-13 22:28:59,642 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 38 predicate places. [2025-03-13 22:28:59,642 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 249 transitions, 1117 flow [2025-03-13 22:28:59,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 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:59,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:28:59,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:28:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:28:59,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:28:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:28:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2101528760, now seen corresponding path program 1 times [2025-03-13 22:28:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:28:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980566792] [2025-03-13 22:28:59,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:28:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:28:59,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:28:59,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:28:59,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:28:59,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:28:59,927 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:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:28:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980566792] [2025-03-13 22:28:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980566792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:28:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:28:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:28:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521878134] [2025-03-13 22:28:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:28:59,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:28:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:28:59,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:28:59,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:28:59,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 185 [2025-03-13 22:28:59,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 249 transitions, 1117 flow. Second operand has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 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:59,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:28:59,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 185 [2025-03-13 22:28:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:00,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L1048-12-->L1048-10: Formula: (and (not (= v_~threads_mask~0_27 0)) (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_27))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} AuxVars[] AssignedVars[][166], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 202#true, 211#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, 85#L1048-10true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:00,192 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-03-13 22:29:00,192 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-03-13 22:29:00,192 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:29:00,192 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-03-13 22:29:00,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][180], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:00,198 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,198 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,198 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,198 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][252], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:00,209 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,209 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,209 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,209 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,216 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][180], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:00,217 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2025-03-13 22:29:00,217 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:29:00,217 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:29:00,217 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-03-13 22:29:00,217 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:29:00,221 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][180], [Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), 240#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:00,221 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-13 22:29:00,221 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,221 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,221 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,221 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,221 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:00,313 INFO L124 PetriNetUnfolderBase]: 631/2476 cut-off events. [2025-03-13 22:29:00,313 INFO L125 PetriNetUnfolderBase]: For 2563/2625 co-relation queries the response was YES. [2025-03-13 22:29:00,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 2476 events. 631/2476 cut-off events. For 2563/2625 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 19241 event pairs, 99 based on Foata normal form. 12/2228 useless extension candidates. Maximal degree in co-relation 4995. Up to 557 conditions per place. [2025-03-13 22:29:00,329 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 75 selfloop transitions, 48 changer transitions 0/320 dead transitions. [2025-03-13 22:29:00,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 320 transitions, 1639 flow [2025-03-13 22:29:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1015 transitions. [2025-03-13 22:29:00,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144144144144144 [2025-03-13 22:29:00,332 INFO L175 Difference]: Start difference. First operand has 210 places, 249 transitions, 1117 flow. Second operand 6 states and 1015 transitions. [2025-03-13 22:29:00,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 320 transitions, 1639 flow [2025-03-13 22:29:00,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 320 transitions, 1639 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:00,344 INFO L231 Difference]: Finished difference. Result has 220 places, 292 transitions, 1505 flow [2025-03-13 22:29:00,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1505, PETRI_PLACES=220, PETRI_TRANSITIONS=292} [2025-03-13 22:29:00,345 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 48 predicate places. [2025-03-13 22:29:00,345 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 292 transitions, 1505 flow [2025-03-13 22:29:00,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 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:29:00,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:00,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:00,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:29:00,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:00,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 3462018, now seen corresponding path program 1 times [2025-03-13 22:29:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:00,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813188240] [2025-03-13 22:29:00,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:00,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-13 22:29:00,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-13 22:29:00,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:00,616 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:29:00,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:00,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813188240] [2025-03-13 22:29:00,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813188240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:00,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:00,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308400333] [2025-03-13 22:29:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:00,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:00,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:00,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2025-03-13 22:29:00,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 292 transitions, 1505 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 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:29:00,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:00,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2025-03-13 22:29:00,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:00,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][170], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 251#true, 262#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:00,920 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-13 22:29:00,920 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,920 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:00,920 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:01,010 INFO L124 PetriNetUnfolderBase]: 611/2520 cut-off events. [2025-03-13 22:29:01,011 INFO L125 PetriNetUnfolderBase]: For 3109/3196 co-relation queries the response was YES. [2025-03-13 22:29:01,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5915 conditions, 2520 events. 611/2520 cut-off events. For 3109/3196 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 19969 event pairs, 111 based on Foata normal form. 14/2283 useless extension candidates. Maximal degree in co-relation 5664. Up to 612 conditions per place. [2025-03-13 22:29:01,025 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 95 selfloop transitions, 31 changer transitions 7/328 dead transitions. [2025-03-13 22:29:01,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 328 transitions, 1948 flow [2025-03-13 22:29:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 979 transitions. [2025-03-13 22:29:01,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.881981981981982 [2025-03-13 22:29:01,027 INFO L175 Difference]: Start difference. First operand has 220 places, 292 transitions, 1505 flow. Second operand 6 states and 979 transitions. [2025-03-13 22:29:01,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 328 transitions, 1948 flow [2025-03-13 22:29:01,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 328 transitions, 1930 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:01,041 INFO L231 Difference]: Finished difference. Result has 230 places, 313 transitions, 1788 flow [2025-03-13 22:29:01,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1788, PETRI_PLACES=230, PETRI_TRANSITIONS=313} [2025-03-13 22:29:01,042 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2025-03-13 22:29:01,042 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 313 transitions, 1788 flow [2025-03-13 22:29:01,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 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:29:01,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:01,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:01,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:29:01,042 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:01,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:01,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1073466046, now seen corresponding path program 1 times [2025-03-13 22:29:01,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:01,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845206485] [2025-03-13 22:29:01,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:01,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:01,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:29:01,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:29:01,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:01,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:01,076 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:29:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845206485] [2025-03-13 22:29:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845206485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:01,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:01,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113028275] [2025-03-13 22:29:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:01,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-03-13 22:29:01,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 313 transitions, 1788 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:29:01,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:01,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-03-13 22:29:01,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:01,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][267], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:01,266 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:29:01,267 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:01,267 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:01,267 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:01,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][171], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 251#true, 262#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:01,276 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-13 22:29:01,276 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:01,276 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:01,276 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:01,361 INFO L124 PetriNetUnfolderBase]: 763/2898 cut-off events. [2025-03-13 22:29:01,361 INFO L125 PetriNetUnfolderBase]: For 3672/3793 co-relation queries the response was YES. [2025-03-13 22:29:01,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6767 conditions, 2898 events. 763/2898 cut-off events. For 3672/3793 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 23974 event pairs, 114 based on Foata normal form. 14/2633 useless extension candidates. Maximal degree in co-relation 6515. Up to 550 conditions per place. [2025-03-13 22:29:01,377 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 35 selfloop transitions, 11 changer transitions 3/329 dead transitions. [2025-03-13 22:29:01,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 329 transitions, 1948 flow [2025-03-13 22:29:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-03-13 22:29:01,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2025-03-13 22:29:01,379 INFO L175 Difference]: Start difference. First operand has 230 places, 313 transitions, 1788 flow. Second operand 3 states and 522 transitions. [2025-03-13 22:29:01,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 329 transitions, 1948 flow [2025-03-13 22:29:01,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 329 transitions, 1892 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:01,394 INFO L231 Difference]: Finished difference. Result has 230 places, 317 transitions, 1790 flow [2025-03-13 22:29:01,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1790, PETRI_PLACES=230, PETRI_TRANSITIONS=317} [2025-03-13 22:29:01,394 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 58 predicate places. [2025-03-13 22:29:01,395 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 317 transitions, 1790 flow [2025-03-13 22:29:01,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:29:01,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:01,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:01,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:29:01,395 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:01,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash -660560356, now seen corresponding path program 1 times [2025-03-13 22:29:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-03-13 22:29:01,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:29:01,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:29:01,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:01,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:01,776 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:29:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:01,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967802386] [2025-03-13 22:29:01,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967802386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:01,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:01,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:29:01,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209222676] [2025-03-13 22:29:01,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:29:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:01,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:29:01,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:29:02,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 185 [2025-03-13 22:29:02,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 317 transitions, 1790 flow. Second operand has 11 states, 11 states have (on average 147.27272727272728) internal successors, (1620), 11 states have internal predecessors, (1620), 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:29:02,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:02,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 185 [2025-03-13 22:29:02,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:02,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L1048-12-->L1048-10: Formula: (and (not (= v_~threads_mask~0_27 0)) (not (= |v_threadThread1of1ForFork0_#t~bitwise5_7| v_~threads_mask~0_27))) InVars {threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} OutVars{threadThread1of1ForFork0_#t~bitwise5=|v_threadThread1of1ForFork0_#t~bitwise5_7|, ~threads_mask~0=v_~threads_mask~0_27} AuxVars[] AssignedVars[][171], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 251#true, 262#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), Black: 202#true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 211#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 223#(not (= ~threads_mask~0 0)), 204#(not (= ~threads_mask~0 0)), Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, 217#(not (= ~threads_mask~0 0)), Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, 85#L1048-10true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:02,527 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2025-03-13 22:29:02,527 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-03-13 22:29:02,527 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2025-03-13 22:29:02,527 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2025-03-13 22:29:02,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 251#true, 262#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:02,533 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,533 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,533 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:02,533 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L1059-6-->L1059-5: Formula: (= v_~threads_mask~0_1 |v_ULTIMATE.start_main_#t~bitwise18#1_3|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} OutVars{~threads_mask~0=v_~threads_mask~0_1, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_3|} AuxVars[] AssignedVars[~threads_mask~0][334], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 251#true, 262#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 204#(not (= ~threads_mask~0 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:02,551 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,551 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:02,551 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,551 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:02,566 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 251#true, 262#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 204#(not (= ~threads_mask~0 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:02,566 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2025-03-13 22:29:02,566 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:29:02,566 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2025-03-13 22:29:02,566 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:29:02,566 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2025-03-13 22:29:02,572 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), 273#true, Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), 185#(= |#race~datas~0| 0), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:02,572 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-13 22:29:02,572 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,572 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:02,572 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:02,572 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,572 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:02,712 INFO L124 PetriNetUnfolderBase]: 790/3132 cut-off events. [2025-03-13 22:29:02,712 INFO L125 PetriNetUnfolderBase]: For 4552/4682 co-relation queries the response was YES. [2025-03-13 22:29:02,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7932 conditions, 3132 events. 790/3132 cut-off events. For 4552/4682 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 26397 event pairs, 97 based on Foata normal form. 55/2941 useless extension candidates. Maximal degree in co-relation 7665. Up to 480 conditions per place. [2025-03-13 22:29:02,727 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 164 selfloop transitions, 67 changer transitions 0/423 dead transitions. [2025-03-13 22:29:02,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 423 transitions, 2836 flow [2025-03-13 22:29:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 22:29:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 22:29:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2736 transitions. [2025-03-13 22:29:02,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8216216216216217 [2025-03-13 22:29:02,731 INFO L175 Difference]: Start difference. First operand has 230 places, 317 transitions, 1790 flow. Second operand 18 states and 2736 transitions. [2025-03-13 22:29:02,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 423 transitions, 2836 flow [2025-03-13 22:29:02,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 423 transitions, 2814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:02,753 INFO L231 Difference]: Finished difference. Result has 245 places, 335 transitions, 2027 flow [2025-03-13 22:29:02,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2027, PETRI_PLACES=245, PETRI_TRANSITIONS=335} [2025-03-13 22:29:02,754 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 73 predicate places. [2025-03-13 22:29:02,754 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 335 transitions, 2027 flow [2025-03-13 22:29:02,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 147.27272727272728) internal successors, (1620), 11 states have internal predecessors, (1620), 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:29:02,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:02,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:02,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:29:02,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:02,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1220974174, now seen corresponding path program 1 times [2025-03-13 22:29:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199089151] [2025-03-13 22:29:02,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:02,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:29:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:29:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:03,231 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:29:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199089151] [2025-03-13 22:29:03,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199089151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:03,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:03,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:29:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659921317] [2025-03-13 22:29:03,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:03,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 22:29:03,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:03,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 22:29:03,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-13 22:29:03,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 185 [2025-03-13 22:29:03,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 335 transitions, 2027 flow. Second operand has 12 states, 12 states have (on average 144.25) internal successors, (1731), 12 states have internal predecessors, (1731), 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:29:03,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:03,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 185 [2025-03-13 22:29:03,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:03,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([428] L1048-6-->L1048-5: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_23) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_23, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][172], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 189#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 200#(<= (+ ~threads_mask~0 1) 0), 50#L1059-5true, Black: 265#(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))) 0) (= (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)) 0)), Black: 266#(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))) 0) (= (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)) 0) (= (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)) 0)), Black: 205#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 0))), 158#L1048-5true, Black: 267#(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))) 0) (= (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)) 0) (= (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)) 0) (= (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)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 204#(not (= ~threads_mask~0 0)), 185#(= |#race~datas~0| 0), Black: 275#(= |threadThread1of1ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 211#(not (= ~threads_mask~0 0)), Black: 212#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise13#1|)), 296#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0))), Black: 218#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), Black: 217#(not (= ~threads_mask~0 0)), 202#true, Black: 224#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 223#(not (= ~threads_mask~0 0)), Black: 229#(<= 0 (+ ~threads_mask~0 1)), Black: 232#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~bitwise17#1|)) (<= 0 (+ ~threads_mask~0 1))), 325#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), 173#true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 278#true, 227#true, Black: 178#true, Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 183#true, Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))))]) [2025-03-13 22:29:03,989 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-03-13 22:29:03,989 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:03,989 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-03-13 22:29:03,989 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-03-13 22:29:04,091 INFO L124 PetriNetUnfolderBase]: 731/2992 cut-off events. [2025-03-13 22:29:04,092 INFO L125 PetriNetUnfolderBase]: For 4672/4772 co-relation queries the response was YES. [2025-03-13 22:29:04,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 2992 events. 731/2992 cut-off events. For 4672/4772 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 24822 event pairs, 124 based on Foata normal form. 26/2794 useless extension candidates. Maximal degree in co-relation 7589. Up to 636 conditions per place. [2025-03-13 22:29:04,105 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 75 selfloop transitions, 6 changer transitions 112/369 dead transitions. [2025-03-13 22:29:04,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 369 transitions, 2661 flow [2025-03-13 22:29:04,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 22:29:04,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 22:29:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1921 transitions. [2025-03-13 22:29:04,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7987525987525987 [2025-03-13 22:29:04,109 INFO L175 Difference]: Start difference. First operand has 245 places, 335 transitions, 2027 flow. Second operand 13 states and 1921 transitions. [2025-03-13 22:29:04,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 369 transitions, 2661 flow [2025-03-13 22:29:04,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 369 transitions, 2505 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-03-13 22:29:04,128 INFO L231 Difference]: Finished difference. Result has 248 places, 257 transitions, 1432 flow [2025-03-13 22:29:04,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1432, PETRI_PLACES=248, PETRI_TRANSITIONS=257} [2025-03-13 22:29:04,129 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 76 predicate places. [2025-03-13 22:29:04,129 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 1432 flow [2025-03-13 22:29:04,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 144.25) internal successors, (1731), 12 states have internal predecessors, (1731), 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:29:04,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:04,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:04,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:29:04,130 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:04,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 571186280, now seen corresponding path program 1 times [2025-03-13 22:29:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-13 22:29:04,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:04,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:29:04,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:29:04,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:04,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:04,263 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:29:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:04,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-13 22:29:04,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945476030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:04,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:29:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978765827] [2025-03-13 22:29:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:04,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:29:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:04,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:29:04,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:29:04,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2025-03-13 22:29:04,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 1432 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 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:29:04,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:04,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2025-03-13 22:29:04,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:04,878 INFO L124 PetriNetUnfolderBase]: 1414/4633 cut-off events. [2025-03-13 22:29:04,878 INFO L125 PetriNetUnfolderBase]: For 8469/8591 co-relation queries the response was YES. [2025-03-13 22:29:04,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11972 conditions, 4633 events. 1414/4633 cut-off events. For 8469/8591 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 38532 event pairs, 268 based on Foata normal form. 93/4391 useless extension candidates. Maximal degree in co-relation 11934. Up to 1273 conditions per place. [2025-03-13 22:29:04,903 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 101 selfloop transitions, 51 changer transitions 0/357 dead transitions. [2025-03-13 22:29:04,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 357 transitions, 2339 flow [2025-03-13 22:29:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:29:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:29:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2301 transitions. [2025-03-13 22:29:04,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884169884169885 [2025-03-13 22:29:04,907 INFO L175 Difference]: Start difference. First operand has 248 places, 257 transitions, 1432 flow. Second operand 14 states and 2301 transitions. [2025-03-13 22:29:04,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 357 transitions, 2339 flow [2025-03-13 22:29:04,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 357 transitions, 2292 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-03-13 22:29:04,925 INFO L231 Difference]: Finished difference. Result has 225 places, 305 transitions, 2036 flow [2025-03-13 22:29:04,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2036, PETRI_PLACES=225, PETRI_TRANSITIONS=305} [2025-03-13 22:29:04,926 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 53 predicate places. [2025-03-13 22:29:04,926 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 305 transitions, 2036 flow [2025-03-13 22:29:04,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 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:29:04,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:04,926 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:04,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:29:04,927 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:04,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 900393376, now seen corresponding path program 1 times [2025-03-13 22:29:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197163923] [2025-03-13 22:29:04,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:04,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:29:04,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:29:04,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:04,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:29:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197163923] [2025-03-13 22:29:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197163923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:05,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:29:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534262097] [2025-03-13 22:29:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:29:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:05,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:29:05,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:29:05,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-03-13 22:29:05,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 305 transitions, 2036 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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:29:05,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:05,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-03-13 22:29:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:05,708 INFO L124 PetriNetUnfolderBase]: 1310/4434 cut-off events. [2025-03-13 22:29:05,708 INFO L125 PetriNetUnfolderBase]: For 11841/11999 co-relation queries the response was YES. [2025-03-13 22:29:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12975 conditions, 4434 events. 1310/4434 cut-off events. For 11841/11999 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 36888 event pairs, 242 based on Foata normal form. 63/4174 useless extension candidates. Maximal degree in co-relation 12931. Up to 1173 conditions per place. [2025-03-13 22:29:05,734 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 93 selfloop transitions, 63 changer transitions 0/362 dead transitions. [2025-03-13 22:29:05,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 362 transitions, 2718 flow [2025-03-13 22:29:05,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:29:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:29:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2303 transitions. [2025-03-13 22:29:05,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8891891891891892 [2025-03-13 22:29:05,737 INFO L175 Difference]: Start difference. First operand has 225 places, 305 transitions, 2036 flow. Second operand 14 states and 2303 transitions. [2025-03-13 22:29:05,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 362 transitions, 2718 flow [2025-03-13 22:29:05,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 362 transitions, 2647 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-03-13 22:29:05,767 INFO L231 Difference]: Finished difference. Result has 241 places, 321 transitions, 2291 flow [2025-03-13 22:29:05,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=1979, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2291, PETRI_PLACES=241, PETRI_TRANSITIONS=321} [2025-03-13 22:29:05,768 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 69 predicate places. [2025-03-13 22:29:05,768 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 321 transitions, 2291 flow [2025-03-13 22:29:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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:29:05,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:05,768 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:05,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:29:05,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:05,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -742000189, now seen corresponding path program 1 times [2025-03-13 22:29:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:05,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494455260] [2025-03-13 22:29:05,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:05,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:29:05,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:29:05,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:05,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:29:05,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:05,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494455260] [2025-03-13 22:29:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494455260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:05,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:29:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544715760] [2025-03-13 22:29:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:05,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:29:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:05,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:29:05,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:29:06,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2025-03-13 22:29:06,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 321 transitions, 2291 flow. Second operand has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 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:29:06,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:06,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2025-03-13 22:29:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:06,796 INFO L124 PetriNetUnfolderBase]: 1571/5457 cut-off events. [2025-03-13 22:29:06,796 INFO L125 PetriNetUnfolderBase]: For 18405/18620 co-relation queries the response was YES. [2025-03-13 22:29:06,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16698 conditions, 5457 events. 1571/5457 cut-off events. For 18405/18620 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 48833 event pairs, 262 based on Foata normal form. 102/5178 useless extension candidates. Maximal degree in co-relation 16649. Up to 1384 conditions per place. [2025-03-13 22:29:06,827 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 152 selfloop transitions, 50 changer transitions 0/407 dead transitions. [2025-03-13 22:29:06,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 407 transitions, 3381 flow [2025-03-13 22:29:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:29:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:29:06,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2305 transitions. [2025-03-13 22:29:06,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.88996138996139 [2025-03-13 22:29:06,829 INFO L175 Difference]: Start difference. First operand has 241 places, 321 transitions, 2291 flow. Second operand 14 states and 2305 transitions. [2025-03-13 22:29:06,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 407 transitions, 3381 flow [2025-03-13 22:29:06,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 407 transitions, 3311 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-13 22:29:06,873 INFO L231 Difference]: Finished difference. Result has 259 places, 356 transitions, 2774 flow [2025-03-13 22:29:06,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2774, PETRI_PLACES=259, PETRI_TRANSITIONS=356} [2025-03-13 22:29:06,873 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 87 predicate places. [2025-03-13 22:29:06,873 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 356 transitions, 2774 flow [2025-03-13 22:29:06,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 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:29:06,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:06,874 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:06,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:29:06,874 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:06,875 INFO L85 PathProgramCache]: Analyzing trace with hash -412793093, now seen corresponding path program 1 times [2025-03-13 22:29:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:06,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297088580] [2025-03-13 22:29:06,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:06,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-13 22:29:06,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-13 22:29:06,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:06,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:29:06,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:06,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297088580] [2025-03-13 22:29:06,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297088580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:06,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:29:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428704723] [2025-03-13 22:29:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:06,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:29:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:06,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:29:06,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:29:07,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-03-13 22:29:07,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 356 transitions, 2774 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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:29:07,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:07,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-03-13 22:29:07,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:07,752 INFO L124 PetriNetUnfolderBase]: 1444/5216 cut-off events. [2025-03-13 22:29:07,752 INFO L125 PetriNetUnfolderBase]: For 22885/23138 co-relation queries the response was YES. [2025-03-13 22:29:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16855 conditions, 5216 events. 1444/5216 cut-off events. For 22885/23138 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 46886 event pairs, 230 based on Foata normal form. 62/4917 useless extension candidates. Maximal degree in co-relation 16796. Up to 1264 conditions per place. [2025-03-13 22:29:07,793 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 144 selfloop transitions, 62 changer transitions 0/412 dead transitions. [2025-03-13 22:29:07,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 412 transitions, 3679 flow [2025-03-13 22:29:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 22:29:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 22:29:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2307 transitions. [2025-03-13 22:29:07,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8907335907335907 [2025-03-13 22:29:07,795 INFO L175 Difference]: Start difference. First operand has 259 places, 356 transitions, 2774 flow. Second operand 14 states and 2307 transitions. [2025-03-13 22:29:07,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 412 transitions, 3679 flow [2025-03-13 22:29:07,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 412 transitions, 3587 flow, removed 46 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:07,857 INFO L231 Difference]: Finished difference. Result has 276 places, 372 transitions, 3038 flow [2025-03-13 22:29:07,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3038, PETRI_PLACES=276, PETRI_TRANSITIONS=372} [2025-03-13 22:29:07,858 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 104 predicate places. [2025-03-13 22:29:07,858 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 372 transitions, 3038 flow [2025-03-13 22:29:07,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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:29:07,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:07,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:07,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:29:07,859 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:07,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1141409055, now seen corresponding path program 1 times [2025-03-13 22:29:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059219255] [2025-03-13 22:29:07,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:07,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:07,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:29:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:29:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 22:29:07,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:29:07,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059219255] [2025-03-13 22:29:07,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059219255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:07,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:07,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150523188] [2025-03-13 22:29:07,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:07,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:29:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:29:07,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:29:07,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:29:07,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 185 [2025-03-13 22:29:07,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 372 transitions, 3038 flow. Second operand has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 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:29:07,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:07,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 185 [2025-03-13 22:29:07,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:08,681 INFO L124 PetriNetUnfolderBase]: 1588/6828 cut-off events. [2025-03-13 22:29:08,681 INFO L125 PetriNetUnfolderBase]: For 25713/26076 co-relation queries the response was YES. [2025-03-13 22:29:08,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21200 conditions, 6828 events. 1588/6828 cut-off events. For 25713/26076 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 70693 event pairs, 103 based on Foata normal form. 49/6501 useless extension candidates. Maximal degree in co-relation 21136. Up to 455 conditions per place. [2025-03-13 22:29:08,718 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 64 selfloop transitions, 7 changer transitions 0/400 dead transitions. [2025-03-13 22:29:08,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 400 transitions, 3301 flow [2025-03-13 22:29:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2025-03-13 22:29:08,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9072072072072072 [2025-03-13 22:29:08,719 INFO L175 Difference]: Start difference. First operand has 276 places, 372 transitions, 3038 flow. Second operand 6 states and 1007 transitions. [2025-03-13 22:29:08,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 400 transitions, 3301 flow [2025-03-13 22:29:08,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 400 transitions, 3229 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:08,810 INFO L231 Difference]: Finished difference. Result has 280 places, 377 transitions, 3021 flow [2025-03-13 22:29:08,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=2976, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3021, PETRI_PLACES=280, PETRI_TRANSITIONS=377} [2025-03-13 22:29:08,810 INFO L279 CegarLoopForPetriNet]: 172 programPoint places, 108 predicate places. [2025-03-13 22:29:08,810 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 377 transitions, 3021 flow [2025-03-13 22:29:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 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:29:08,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:08,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:08,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:29:08,811 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:08,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1099483366, now seen corresponding path program 1 times [2025-03-13 22:29:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:29:08,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327055020] [2025-03-13 22:29:08,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:29:08,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:29:08,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:29:08,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:08,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:08,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:29:08,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:29:08,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:29:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:08,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:29:08,876 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:29:08,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-03-13 22:29:08,878 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:29:08,879 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:29:08,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:29:08,880 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:29:08,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:29:08,880 INFO L422 BasicCegarLoop]: Path program 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:29:08,933 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:29:08,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:29:08,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:29:08 BasicIcfg [2025-03-13 22:29:08,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:29:08,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:29:08,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:29:08,939 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:29:08,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:28:55" (3/4) ... [2025-03-13 22:29:08,940 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-13 22:29:08,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:29:08,941 INFO L158 Benchmark]: Toolchain (without parser) took 14314.67ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 112.6MB in the beginning and 267.0MB in the end (delta: -154.4MB). Peak memory consumption was 323.6MB. Max. memory is 16.1GB. [2025-03-13 22:29:08,942 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:29:08,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.74ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 84.3MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:29:08,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.17ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 81.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:29:08,943 INFO L158 Benchmark]: Boogie Preprocessor took 20.83ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 80.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:29:08,943 INFO L158 Benchmark]: IcfgBuilder took 540.42ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 55.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 22:29:08,943 INFO L158 Benchmark]: TraceAbstraction took 13345.27ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 54.9MB in the beginning and 267.1MB in the end (delta: -212.2MB). Peak memory consumption was 264.9MB. Max. memory is 16.1GB. [2025-03-13 22:29:08,943 INFO L158 Benchmark]: Witness Printer took 2.32ms. Allocated memory is still 620.8MB. Free memory was 267.1MB in the beginning and 267.0MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:29:08,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 226.5MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.74ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 84.3MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.17ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 81.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.83ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 80.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 540.42ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 55.4MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13345.27ms. Allocated memory was 142.6MB in the beginning and 620.8MB in the end (delta: 478.2MB). Free memory was 54.9MB in the beginning and 267.1MB in the end (delta: -212.2MB). Peak memory consumption was 264.9MB. Max. memory is 16.1GB. * Witness Printer took 2.32ms. Allocated memory is still 620.8MB. Free memory was 267.1MB in the beginning and 267.0MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1058, overapproximation of bitwiseAnd at line 1059. Possible FailurePath: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=31] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-4:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] 0 int i = 0; VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-4:0}, threads_mask=-1] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] EXPR 0 1 << j VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] 0 i++ VAL [\old(arg)={0:0}, datas={-4:0}, i=1, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, datas={-4:0}, threads_mask=-2] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2331 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1657 mSDsluCounter, 1067 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 873 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5086 IncrementalHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 194 mSDtfsCounter, 5086 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3038occurred in iteration=21, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1854 NumberOfCodeBlocks, 1854 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1718 ConstructedInterpolants, 0 QuantifiedInterpolants, 5348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-13 22:29:08,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-index-bitmask-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:29:10,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:29:10,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2025-03-13 22:29:10,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:29:10,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:29:10,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:29:10,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:29:10,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:29:10,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:29:10,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:29:10,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:29:10,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:29:10,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:29:10,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:29:10,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:29:10,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:10,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:29:10,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:29:10,906 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2025-03-13 22:29:11,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:29:11,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:29:11,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:29:11,136 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:29:11,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:29:11,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-03-13 22:29:12,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543d043c0/3193e36ba7f04f6683dab457a7efdb09/FLAG614a6b2a6 [2025-03-13 22:29:12,532 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:29:12,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2025-03-13 22:29:12,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543d043c0/3193e36ba7f04f6683dab457a7efdb09/FLAG614a6b2a6 [2025-03-13 22:29:12,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543d043c0/3193e36ba7f04f6683dab457a7efdb09 [2025-03-13 22:29:12,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:29:12,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:29:12,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:12,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:29:12,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:29:12,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:12" (1/1) ... [2025-03-13 22:29:12,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494fa0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:12, skipping insertion in model container [2025-03-13 22:29:12,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:29:12" (1/1) ... [2025-03-13 22:29:12,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:29:12,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:12,933 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:29:12,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:29:13,029 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:29:13,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13 WrapperNode [2025-03-13 22:29:13,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:29:13,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:13,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:29:13,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:29:13,034 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:29:13" (1/1) ... [2025-03-13 22:29:13,048 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:29:13" (1/1) ... [2025-03-13 22:29:13,062 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2025-03-13 22:29:13,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:29:13,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:29:13,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:29:13,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:29:13,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:29:13,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:29:13,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:29:13,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:29:13,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (1/1) ... [2025-03-13 22:29:13,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:29:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:13,132 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:29:13,135 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:29:13,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-13 22:29:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:29:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-13 22:29:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:29:13,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:29:13,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:29:13,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:29:13,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:29:13,155 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:29:13,242 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:29:13,243 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:29:13,485 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:29:13,486 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:29:13,486 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:29:13,509 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:29:13,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:13 BoogieIcfgContainer [2025-03-13 22:29:13,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:29:13,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:29:13,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:29:13,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:29:13,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:29:12" (1/3) ... [2025-03-13 22:29:13,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac77a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:13, skipping insertion in model container [2025-03-13 22:29:13,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:29:13" (2/3) ... [2025-03-13 22:29:13,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac77a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:29:13, skipping insertion in model container [2025-03-13 22:29:13,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:13" (3/3) ... [2025-03-13 22:29:13,515 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2025-03-13 22:29:13,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:29:13,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-bitmask-race.i that has 2 procedures, 128 locations, 1 initial locations, 2 loop locations, and 11 error locations. [2025-03-13 22:29:13,526 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:29:13,577 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:29:13,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 132 transitions, 271 flow [2025-03-13 22:29:13,664 INFO L124 PetriNetUnfolderBase]: 5/185 cut-off events. [2025-03-13 22:29:13,667 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:29:13,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 185 events. 5/185 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 346 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2025-03-13 22:29:13,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 132 transitions, 271 flow [2025-03-13 22:29:13,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 132 transitions, 271 flow [2025-03-13 22:29:13,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:29:13,688 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;@3fb6df85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:29:13,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-13 22:29:13,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:29:13,699 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-13 22:29:13,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:29:13,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:13,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:13,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1878358499, now seen corresponding path program 1 times [2025-03-13 22:29:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571539072] [2025-03-13 22:29:13,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:13,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:13,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:13,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:13,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:29:13,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 22:29:13,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 22:29:13,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:13,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:13,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:29:13,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:13,820 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:29:13,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:13,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:13,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571539072] [2025-03-13 22:29:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571539072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:13,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106448762] [2025-03-13 22:29:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:13,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:13,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:13,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:13,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2025-03-13 22:29:13,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 132 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:13,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:13,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2025-03-13 22:29:13,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:13,925 INFO L124 PetriNetUnfolderBase]: 5/234 cut-off events. [2025-03-13 22:29:13,925 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:29:13,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 234 events. 5/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 542 event pairs, 2 based on Foata normal form. 2/202 useless extension candidates. Maximal degree in co-relation 146. Up to 15 conditions per place. [2025-03-13 22:29:13,927 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 8 selfloop transitions, 2 changer transitions 2/129 dead transitions. [2025-03-13 22:29:13,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 285 flow [2025-03-13 22:29:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-03-13 22:29:13,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9343434343434344 [2025-03-13 22:29:13,940 INFO L175 Difference]: Start difference. First operand has 131 places, 132 transitions, 271 flow. Second operand 3 states and 370 transitions. [2025-03-13 22:29:13,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 285 flow [2025-03-13 22:29:13,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 129 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:13,947 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 265 flow [2025-03-13 22:29:13,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2025-03-13 22:29:13,951 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-03-13 22:29:13,951 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 265 flow [2025-03-13 22:29:13,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:29:13,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:13,951 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:29:13,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:29:14,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:14,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2128611472, now seen corresponding path program 1 times [2025-03-13 22:29:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306101708] [2025-03-13 22:29:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:14,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:14,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:14,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:29:14,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:29:14,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:29:14,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:14,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:29:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:14,239 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:29:14,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:14,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306101708] [2025-03-13 22:29:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306101708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:14,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:14,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896103693] [2025-03-13 22:29:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:14,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:14,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:14,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:14,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:14,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2025-03-13 22:29:14,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:29:14,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:14,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2025-03-13 22:29:14,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:14,311 INFO L124 PetriNetUnfolderBase]: 20/306 cut-off events. [2025-03-13 22:29:14,312 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:29:14,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 306 events. 20/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1054 event pairs, 7 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 331. Up to 36 conditions per place. [2025-03-13 22:29:14,313 INFO L140 encePairwiseOnDemand]: 121/132 looper letters, 13 selfloop transitions, 8 changer transitions 0/135 dead transitions. [2025-03-13 22:29:14,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 323 flow [2025-03-13 22:29:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-03-13 22:29:14,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946969696969697 [2025-03-13 22:29:14,315 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 265 flow. Second operand 3 states and 375 transitions. [2025-03-13 22:29:14,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 323 flow [2025-03-13 22:29:14,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:14,321 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 331 flow [2025-03-13 22:29:14,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-03-13 22:29:14,322 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 1 predicate places. [2025-03-13 22:29:14,322 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 331 flow [2025-03-13 22:29:14,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:29:14,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:14,322 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] [2025-03-13 22:29:14,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 22:29:14,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:14,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:14,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash -375985712, now seen corresponding path program 1 times [2025-03-13 22:29:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [320174073] [2025-03-13 22:29:14,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:14,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:14,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:14,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:14,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:29:14,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 22:29:14,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 22:29:14,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:14,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:14,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:29:14,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:14,598 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:29:14,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:14,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320174073] [2025-03-13 22:29:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320174073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:14,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132514344] [2025-03-13 22:29:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:14,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:14,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:14,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:14,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 132 [2025-03-13 22:29:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:29:14,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:14,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 132 [2025-03-13 22:29:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:14,651 INFO L124 PetriNetUnfolderBase]: 24/365 cut-off events. [2025-03-13 22:29:14,652 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-13 22:29:14,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 365 events. 24/365 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1409 event pairs, 9 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 347. Up to 40 conditions per place. [2025-03-13 22:29:14,655 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-03-13 22:29:14,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 135 transitions, 349 flow [2025-03-13 22:29:14,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-13 22:29:14,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-03-13 22:29:14,657 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 331 flow. Second operand 3 states and 374 transitions. [2025-03-13 22:29:14,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 135 transitions, 349 flow [2025-03-13 22:29:14,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 135 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:14,662 INFO L231 Difference]: Finished difference. Result has 131 places, 135 transitions, 325 flow [2025-03-13 22:29:14,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=131, PETRI_TRANSITIONS=135} [2025-03-13 22:29:14,663 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2025-03-13 22:29:14,663 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 135 transitions, 325 flow [2025-03-13 22:29:14,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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:29:14,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:14,664 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] [2025-03-13 22:29:14,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 22:29:14,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:14,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:14,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash 492732251, now seen corresponding path program 1 times [2025-03-13 22:29:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018884883] [2025-03-13 22:29:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:14,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:14,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:14,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:14,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:29:14,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-13 22:29:14,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-13 22:29:14,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:14,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-13 22:29:14,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:15,076 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:29:15,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:15,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018884883] [2025-03-13 22:29:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018884883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:15,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:15,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-13 22:29:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676753700] [2025-03-13 22:29:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:15,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 22:29:15,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:15,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 22:29:15,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-13 22:29:15,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2025-03-13 22:29:15,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 135 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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:29:15,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:15,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2025-03-13 22:29:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:15,426 INFO L124 PetriNetUnfolderBase]: 21/336 cut-off events. [2025-03-13 22:29:15,426 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2025-03-13 22:29:15,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 336 events. 21/336 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1212 event pairs, 7 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 297. Up to 38 conditions per place. [2025-03-13 22:29:15,428 INFO L140 encePairwiseOnDemand]: 119/132 looper letters, 17 selfloop transitions, 8 changer transitions 5/140 dead transitions. [2025-03-13 22:29:15,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 140 transitions, 395 flow [2025-03-13 22:29:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 22:29:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 22:29:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1186 transitions. [2025-03-13 22:29:15,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168044077134986 [2025-03-13 22:29:15,431 INFO L175 Difference]: Start difference. First operand has 131 places, 135 transitions, 325 flow. Second operand 11 states and 1186 transitions. [2025-03-13 22:29:15,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 140 transitions, 395 flow [2025-03-13 22:29:15,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 140 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:15,438 INFO L231 Difference]: Finished difference. Result has 145 places, 135 transitions, 353 flow [2025-03-13 22:29:15,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=353, PETRI_PLACES=145, PETRI_TRANSITIONS=135} [2025-03-13 22:29:15,439 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 14 predicate places. [2025-03-13 22:29:15,439 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 135 transitions, 353 flow [2025-03-13 22:29:15,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.375) internal successors, (859), 8 states have internal predecessors, (859), 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:29:15,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:15,439 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] [2025-03-13 22:29:15,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-13 22:29:15,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:15,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:15,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1401803981, now seen corresponding path program 1 times [2025-03-13 22:29:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:15,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305811353] [2025-03-13 22:29:15,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:15,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:15,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:15,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:15,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:29:15,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:29:15,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:29:15,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:15,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:15,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:29:15,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:15,718 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:29:15,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:15,718 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:15,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305811353] [2025-03-13 22:29:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305811353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:15,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:15,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426395752] [2025-03-13 22:29:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:15,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:15,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:15,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:15,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2025-03-13 22:29:15,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 135 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:29:15,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:15,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2025-03-13 22:29:15,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:15,773 INFO L124 PetriNetUnfolderBase]: 34/354 cut-off events. [2025-03-13 22:29:15,773 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-03-13 22:29:15,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 354 events. 34/354 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1425 event pairs, 11 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 443. Up to 63 conditions per place. [2025-03-13 22:29:15,774 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 16 selfloop transitions, 7 changer transitions 0/140 dead transitions. [2025-03-13 22:29:15,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 415 flow [2025-03-13 22:29:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-03-13 22:29:15,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9318181818181818 [2025-03-13 22:29:15,776 INFO L175 Difference]: Start difference. First operand has 145 places, 135 transitions, 353 flow. Second operand 3 states and 369 transitions. [2025-03-13 22:29:15,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 415 flow [2025-03-13 22:29:15,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 140 transitions, 391 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-03-13 22:29:15,778 INFO L231 Difference]: Finished difference. Result has 136 places, 140 transitions, 385 flow [2025-03-13 22:29:15,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=136, PETRI_TRANSITIONS=140} [2025-03-13 22:29:15,779 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 5 predicate places. [2025-03-13 22:29:15,779 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 140 transitions, 385 flow [2025-03-13 22:29:15,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:29:15,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:15,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, 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:29:15,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 22:29:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:15,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash -390755206, now seen corresponding path program 1 times [2025-03-13 22:29:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:15,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071804263] [2025-03-13 22:29:15,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:15,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:15,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:29:16,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-13 22:29:16,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-13 22:29:16,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:16,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:16,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:29:16,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:16,094 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:29:16,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:16,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071804263] [2025-03-13 22:29:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071804263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:29:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271123469] [2025-03-13 22:29:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:16,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 132 [2025-03-13 22:29:16,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 140 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:29:16,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:16,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 132 [2025-03-13 22:29:16,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:16,136 INFO L124 PetriNetUnfolderBase]: 29/337 cut-off events. [2025-03-13 22:29:16,137 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:29:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 337 events. 29/337 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1277 event pairs, 7 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 397. Up to 40 conditions per place. [2025-03-13 22:29:16,139 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 4 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-03-13 22:29:16,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 141 transitions, 399 flow [2025-03-13 22:29:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-03-13 22:29:16,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9646464646464646 [2025-03-13 22:29:16,141 INFO L175 Difference]: Start difference. First operand has 136 places, 140 transitions, 385 flow. Second operand 3 states and 382 transitions. [2025-03-13 22:29:16,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 141 transitions, 399 flow [2025-03-13 22:29:16,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 141 transitions, 385 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:29:16,143 INFO L231 Difference]: Finished difference. Result has 137 places, 141 transitions, 383 flow [2025-03-13 22:29:16,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=137, PETRI_TRANSITIONS=141} [2025-03-13 22:29:16,144 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 6 predicate places. [2025-03-13 22:29:16,144 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 141 transitions, 383 flow [2025-03-13 22:29:16,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:29:16,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:16,144 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] [2025-03-13 22:29:16,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 22:29:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:16,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash 702413520, now seen corresponding path program 1 times [2025-03-13 22:29:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2225685] [2025-03-13 22:29:16,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:16,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:16,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 22:29:16,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-13 22:29:16,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-13 22:29:16,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:16,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:16,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:29:16,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-13 22:29:16,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-03-13 22:29:16,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:29:16,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2025-03-13 22:29:16,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:29:16,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 52 [2025-03-13 22:29:16,743 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:29:16,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:16,743 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2225685] [2025-03-13 22:29:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2225685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:29:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139259433] [2025-03-13 22:29:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:16,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:29:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:16,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:29:16,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:29:17,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 132 [2025-03-13 22:29:17,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 141 transitions, 383 flow. Second operand has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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:29:17,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:17,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 132 [2025-03-13 22:29:17,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:17,156 INFO L124 PetriNetUnfolderBase]: 92/606 cut-off events. [2025-03-13 22:29:17,156 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-13 22:29:17,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 606 events. 92/606 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3309 event pairs, 8 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 905. Up to 137 conditions per place. [2025-03-13 22:29:17,159 INFO L140 encePairwiseOnDemand]: 111/132 looper letters, 32 selfloop transitions, 20 changer transitions 0/157 dead transitions. [2025-03-13 22:29:17,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 519 flow [2025-03-13 22:29:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:29:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:29:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1157 transitions. [2025-03-13 22:29:17,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7304292929292929 [2025-03-13 22:29:17,163 INFO L175 Difference]: Start difference. First operand has 137 places, 141 transitions, 383 flow. Second operand 12 states and 1157 transitions. [2025-03-13 22:29:17,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 519 flow [2025-03-13 22:29:17,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 157 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:29:17,167 INFO L231 Difference]: Finished difference. Result has 152 places, 147 transitions, 461 flow [2025-03-13 22:29:17,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=461, PETRI_PLACES=152, PETRI_TRANSITIONS=147} [2025-03-13 22:29:17,168 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 21 predicate places. [2025-03-13 22:29:17,169 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 147 transitions, 461 flow [2025-03-13 22:29:17,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 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:29:17,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:17,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:17,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 22:29:17,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:17,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:17,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1907866619, now seen corresponding path program 1 times [2025-03-13 22:29:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065841795] [2025-03-13 22:29:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:17,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:17,374 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:17,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 22:29:17,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:29: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:29:17,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:17,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:17,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 22:29:17,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:17,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-03-13 22:29:17,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2025-03-13 22:29:17,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:29:17,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2025-03-13 22:29:17,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:29:17,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2025-03-13 22:29:17,566 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:29:17,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:17,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:17,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065841795] [2025-03-13 22:29:17,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065841795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:29:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740457808] [2025-03-13 22:29:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:17,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:29:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:17,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:29:17,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:29:17,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2025-03-13 22:29:17,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 147 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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:29:17,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:17,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2025-03-13 22:29:17,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:17,847 INFO L124 PetriNetUnfolderBase]: 132/640 cut-off events. [2025-03-13 22:29:17,848 INFO L125 PetriNetUnfolderBase]: For 82/86 co-relation queries the response was YES. [2025-03-13 22:29:17,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 640 events. 132/640 cut-off events. For 82/86 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3449 event pairs, 36 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1018. Up to 198 conditions per place. [2025-03-13 22:29:17,852 INFO L140 encePairwiseOnDemand]: 117/132 looper letters, 24 selfloop transitions, 39 changer transitions 0/184 dead transitions. [2025-03-13 22:29:17,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 693 flow [2025-03-13 22:29:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:29:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:29:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2025-03-13 22:29:17,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002525252525253 [2025-03-13 22:29:17,854 INFO L175 Difference]: Start difference. First operand has 152 places, 147 transitions, 461 flow. Second operand 6 states and 713 transitions. [2025-03-13 22:29:17,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 693 flow [2025-03-13 22:29:17,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 184 transitions, 667 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:29:17,860 INFO L231 Difference]: Finished difference. Result has 156 places, 184 transitions, 725 flow [2025-03-13 22:29:17,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=156, PETRI_TRANSITIONS=184} [2025-03-13 22:29:17,860 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 25 predicate places. [2025-03-13 22:29:17,862 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 725 flow [2025-03-13 22:29:17,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 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:29:17,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:17,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 22:29:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:18,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash -732205087, now seen corresponding path program 1 times [2025-03-13 22:29:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149769577] [2025-03-13 22:29:18,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:18,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:18,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:18,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-13 22:29:18,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-13 22:29:18,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-13 22:29:18,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:18,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:18,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-13 22:29:18,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:18,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:29:18,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-03-13 22:29:18,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:29:18,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2025-03-13 22:29:18,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 22:29:18,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2025-03-13 22:29:18,353 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:29:18,354 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:18,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149769577] [2025-03-13 22:29:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149769577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:18,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:18,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:29:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937408359] [2025-03-13 22:29:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:18,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:29:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:18,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:29:18,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:29:18,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 132 [2025-03-13 22:29:18,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 725 flow. Second operand has 11 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 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:29:18,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:18,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 132 [2025-03-13 22:29:18,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:18,836 INFO L124 PetriNetUnfolderBase]: 149/749 cut-off events. [2025-03-13 22:29:18,837 INFO L125 PetriNetUnfolderBase]: For 401/450 co-relation queries the response was YES. [2025-03-13 22:29:18,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 749 events. 149/749 cut-off events. For 401/450 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4456 event pairs, 20 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 1597. Up to 135 conditions per place. [2025-03-13 22:29:18,842 INFO L140 encePairwiseOnDemand]: 107/132 looper letters, 71 selfloop transitions, 47 changer transitions 2/230 dead transitions. [2025-03-13 22:29:18,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 1188 flow [2025-03-13 22:29:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:29:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:29:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1200 transitions. [2025-03-13 22:29:18,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2025-03-13 22:29:18,845 INFO L175 Difference]: Start difference. First operand has 156 places, 184 transitions, 725 flow. Second operand 12 states and 1200 transitions. [2025-03-13 22:29:18,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 1188 flow [2025-03-13 22:29:18,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 230 transitions, 1164 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-03-13 22:29:18,851 INFO L231 Difference]: Finished difference. Result has 172 places, 217 transitions, 1067 flow [2025-03-13 22:29:18,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1067, PETRI_PLACES=172, PETRI_TRANSITIONS=217} [2025-03-13 22:29:18,852 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 41 predicate places. [2025-03-13 22:29:18,852 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 217 transitions, 1067 flow [2025-03-13 22:29:18,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 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:29:18,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:18,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:18,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-13 22:29:19,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:19,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:19,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1464945855, now seen corresponding path program 1 times [2025-03-13 22:29:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586219888] [2025-03-13 22:29:19,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:19,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:19,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:19,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-13 22:29:19,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-13 22:29:19,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-13 22:29:19,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:19,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:19,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:29:19,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:19,127 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:29:19,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:19,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586219888] [2025-03-13 22:29:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586219888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:19,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:19,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:29:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102617852] [2025-03-13 22:29:19,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:19,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:29:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:19,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:29:19,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:29:19,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2025-03-13 22:29:19,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 217 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:29:19,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:19,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2025-03-13 22:29:19,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:19,225 INFO L124 PetriNetUnfolderBase]: 153/786 cut-off events. [2025-03-13 22:29:19,225 INFO L125 PetriNetUnfolderBase]: For 461/494 co-relation queries the response was YES. [2025-03-13 22:29:19,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 786 events. 153/786 cut-off events. For 461/494 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4872 event pairs, 19 based on Foata normal form. 4/762 useless extension candidates. Maximal degree in co-relation 1777. Up to 143 conditions per place. [2025-03-13 22:29:19,229 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 15 selfloop transitions, 11 changer transitions 12/224 dead transitions. [2025-03-13 22:29:19,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 224 transitions, 1147 flow [2025-03-13 22:29:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:29:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:29:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-03-13 22:29:19,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9444444444444444 [2025-03-13 22:29:19,230 INFO L175 Difference]: Start difference. First operand has 172 places, 217 transitions, 1067 flow. Second operand 3 states and 374 transitions. [2025-03-13 22:29:19,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 224 transitions, 1147 flow [2025-03-13 22:29:19,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 224 transitions, 1101 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:19,237 INFO L231 Difference]: Finished difference. Result has 172 places, 212 transitions, 1067 flow [2025-03-13 22:29:19,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1067, PETRI_PLACES=172, PETRI_TRANSITIONS=212} [2025-03-13 22:29:19,237 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 41 predicate places. [2025-03-13 22:29:19,237 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 212 transitions, 1067 flow [2025-03-13 22:29:19,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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:29:19,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:19,238 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:19,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-13 22:29:19,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:19,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1145604547, now seen corresponding path program 1 times [2025-03-13 22:29:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1138806608] [2025-03-13 22:29:19,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:19,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:19,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:19,442 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:19,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-13 22:29:19,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-13 22:29:19,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-13 22:29:19,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:19,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:19,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-13 22:29:19,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:19,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-13 22:29:19,606 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-13 22:29:19,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-13 22:29:20,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-13 22:29:20,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2025-03-13 22:29:20,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2025-03-13 22:29:20,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2025-03-13 22:29:20,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2025-03-13 22:29:20,896 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:29:20,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:20,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:20,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138806608] [2025-03-13 22:29:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138806608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:20,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:20,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-13 22:29:20,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226027425] [2025-03-13 22:29:20,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:20,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-13 22:29:20,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:20,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-13 22:29:20,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-13 22:29:23,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 132 [2025-03-13 22:29:23,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 212 transitions, 1067 flow. Second operand has 20 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 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:29:23,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:23,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 132 [2025-03-13 22:29:23,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:26,000 INFO L124 PetriNetUnfolderBase]: 267/1078 cut-off events. [2025-03-13 22:29:26,000 INFO L125 PetriNetUnfolderBase]: For 983/1065 co-relation queries the response was YES. [2025-03-13 22:29:26,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 1078 events. 267/1078 cut-off events. For 983/1065 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6959 event pairs, 18 based on Foata normal form. 52/1106 useless extension candidates. Maximal degree in co-relation 2825. Up to 176 conditions per place. [2025-03-13 22:29:26,005 INFO L140 encePairwiseOnDemand]: 102/132 looper letters, 169 selfloop transitions, 70 changer transitions 0/330 dead transitions. [2025-03-13 22:29:26,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 330 transitions, 2079 flow [2025-03-13 22:29:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:29:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:29:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2479 transitions. [2025-03-13 22:29:26,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626010101010101 [2025-03-13 22:29:26,011 INFO L175 Difference]: Start difference. First operand has 172 places, 212 transitions, 1067 flow. Second operand 30 states and 2479 transitions. [2025-03-13 22:29:26,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 330 transitions, 2079 flow [2025-03-13 22:29:26,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 330 transitions, 2051 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:29:26,020 INFO L231 Difference]: Finished difference. Result has 191 places, 228 transitions, 1255 flow [2025-03-13 22:29:26,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1255, PETRI_PLACES=191, PETRI_TRANSITIONS=228} [2025-03-13 22:29:26,021 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 60 predicate places. [2025-03-13 22:29:26,021 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 228 transitions, 1255 flow [2025-03-13 22:29:26,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 79.05) internal successors, (1581), 20 states have internal predecessors, (1581), 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:29:26,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:26,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:26,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-13 22:29:26,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:26,222 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:26,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1387682461, now seen corresponding path program 1 times [2025-03-13 22:29:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:26,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756977155] [2025-03-13 22:29:26,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:26,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:26,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:26,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-13 22:29:26,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-13 22:29:26,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-13 22:29:26,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:26,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:29:26,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-13 22:29:26,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:29:26,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-13 22:29:26,350 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-13 22:29:26,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-13 22:29:26,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 22:29:26,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2025-03-13 22:29:26,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2025-03-13 22:29:26,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2025-03-13 22:29:26,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2025-03-13 22:29:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:29:26,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:29:26,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-13 22:29:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756977155] [2025-03-13 22:29:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756977155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:29:26,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:29:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-13 22:29:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550142836] [2025-03-13 22:29:26,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:29:26,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:29:26,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-13 22:29:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:29:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:29:27,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 132 [2025-03-13 22:29:27,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 228 transitions, 1255 flow. Second operand has 14 states, 14 states have (on average 90.21428571428571) internal successors, (1263), 14 states have internal predecessors, (1263), 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:29:27,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:29:27,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 132 [2025-03-13 22:29:27,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:29:27,689 INFO L124 PetriNetUnfolderBase]: 167/869 cut-off events. [2025-03-13 22:29:27,689 INFO L125 PetriNetUnfolderBase]: For 823/868 co-relation queries the response was YES. [2025-03-13 22:29:27,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 869 events. 167/869 cut-off events. For 823/868 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5276 event pairs, 13 based on Foata normal form. 9/848 useless extension candidates. Maximal degree in co-relation 2356. Up to 159 conditions per place. [2025-03-13 22:29:27,694 INFO L140 encePairwiseOnDemand]: 111/132 looper letters, 95 selfloop transitions, 43 changer transitions 1/255 dead transitions. [2025-03-13 22:29:27,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 255 transitions, 1769 flow [2025-03-13 22:29:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:29:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:29:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1382 transitions. [2025-03-13 22:29:27,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.697979797979798 [2025-03-13 22:29:27,697 INFO L175 Difference]: Start difference. First operand has 191 places, 228 transitions, 1255 flow. Second operand 15 states and 1382 transitions. [2025-03-13 22:29:27,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 255 transitions, 1769 flow [2025-03-13 22:29:27,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 255 transitions, 1624 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-03-13 22:29:27,705 INFO L231 Difference]: Finished difference. Result has 192 places, 231 transitions, 1309 flow [2025-03-13 22:29:27,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1309, PETRI_PLACES=192, PETRI_TRANSITIONS=231} [2025-03-13 22:29:27,705 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 61 predicate places. [2025-03-13 22:29:27,706 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 231 transitions, 1309 flow [2025-03-13 22:29:27,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 90.21428571428571) internal successors, (1263), 14 states have internal predecessors, (1263), 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:29:27,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:29:27,706 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:27,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-13 22:29:27,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:27,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-13 22:29:27,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:29:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1352342025, now seen corresponding path program 1 times [2025-03-13 22:29:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-13 22:29:27,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376106166] [2025-03-13 22:29:27,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:29:27,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:27,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:29:27,914 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:29:27,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-13 22:29:27,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-13 22:29:27,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-13 22:29:27,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:27,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:27,990 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:29:28,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-13 22:29:28,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-13 22:29:28,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:29:28,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:29:28,075 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-13 22:29:28,075 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:29:28,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-13 22:29:28,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-13 22:29:28,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-13 22:29:28,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-13 22:29:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:29:28,279 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:29:28,322 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:29:28,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:29:28,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:29:28 BasicIcfg [2025-03-13 22:29:28,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:29:28,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:29:28,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:29:28,327 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:29:28,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:29:13" (3/4) ... [2025-03-13 22:29:28,329 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:29:28,374 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-13 22:29:28,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:29:28,413 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:29:28,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:29:28,414 INFO L158 Benchmark]: Toolchain (without parser) took 15843.19ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 90.6MB in the beginning and 103.1MB in the end (delta: -12.5MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2025-03-13 22:29:28,414 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:29:28,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.65ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 61.1MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 22:29:28,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.49ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 58.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:29:28,415 INFO L158 Benchmark]: Boogie Preprocessor took 33.70ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 57.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:29:28,415 INFO L158 Benchmark]: IcfgBuilder took 410.44ms. Allocated memory is still 117.4MB. Free memory was 57.1MB in the beginning and 90.0MB in the end (delta: -32.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-13 22:29:28,416 INFO L158 Benchmark]: TraceAbstraction took 14816.24ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 89.3MB in the beginning and 36.2MB in the end (delta: 53.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2025-03-13 22:29:28,416 INFO L158 Benchmark]: Witness Printer took 85.98ms. Allocated memory is still 142.6MB. Free memory was 36.2MB in the beginning and 103.1MB in the end (delta: -66.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:29:28,418 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.65ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 61.1MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.49ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 58.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.70ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 57.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 410.44ms. Allocated memory is still 117.4MB. Free memory was 57.1MB in the beginning and 90.0MB in the end (delta: -32.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14816.24ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 89.3MB in the beginning and 36.2MB in the end (delta: 53.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Witness Printer took 85.98ms. Allocated memory is still 142.6MB. Free memory was 36.2MB in the beginning and 103.1MB in the end (delta: -66.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1058]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=2] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=2, tids={2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={4:0}, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] 0 int i = 0; VAL [datas={4:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={4:0}, threads_mask=-1] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={4:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={4:0}, i=0, j=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={4:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, i=1, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={4:0}, i=1, j=0, threads_mask=-1, threads_total=2, tids={2:0}] Now there is a data race on ~threads_mask~0 between C: threads_mask |= 1 << j [1048] and C: ffs(threads_mask) [1058] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 157 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1795 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1466 mSDsluCounter, 4223 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4089 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6467 IncrementalHoareTripleChecker+Invalid, 6617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 134 mSDtfsCounter, 6467 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 735 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1309occurred in iteration=12, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 4132 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1101 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 22:29:28,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)