./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:46:13,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:46:13,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:46:13,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:46:13,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:46:13,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:46:13,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:46:13,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:46:13,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:46:13,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:46:13,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:46:13,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:46:13,350 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:46:13,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:46:13,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:46:13,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:46:13,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:46:13,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:46:13,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:46:13,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:46:13,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:46:13,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:46:13,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:46:13,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:46:13,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:13,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:46:13,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:46:13,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:46:13,354 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-jdk21/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 -> 4e3d22e98e469d91cee59ee59a7893605d6313bab33afdf939e81a0c217e3b1b [2025-02-08 05:46:13,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:46:13,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:46:13,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:46:13,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:46:13,647 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:46:13,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2025-02-08 05:46:14,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/124d56291/ddbf33888165457b8191d7cf8fc34da0/FLAG76e3f46b1 [2025-02-08 05:46:15,329 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:46:15,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/value-barrier-race.i [2025-02-08 05:46:15,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/124d56291/ddbf33888165457b8191d7cf8fc34da0/FLAG76e3f46b1 [2025-02-08 05:46:15,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/124d56291/ddbf33888165457b8191d7cf8fc34da0 [2025-02-08 05:46:15,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:46:15,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:46:15,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:15,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:46:15,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:46:15,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:15,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15, skipping insertion in model container [2025-02-08 05:46:15,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:15,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:46:15,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:15,891 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:46:15,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:46:15,978 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:46:15,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15 WrapperNode [2025-02-08 05:46:15,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:46:15,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:15,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:46:15,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:46:15,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,017 INFO L138 Inliner]: procedures = 261, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2025-02-08 05:46:16,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:46:16,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:46:16,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:46:16,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:46:16,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:46:16,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:46:16,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:46:16,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:46:16,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (1/1) ... [2025-02-08 05:46:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:46:16,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:46:16,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:46:16,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:46:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:46:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:46:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:46:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:46:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:46:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:46:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:46:16,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:46:16,098 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:46:16,202 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:46:16,204 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:46:16,452 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:46:16,454 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:46:16,467 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:46:16,468 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:46:16,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:16 BoogieIcfgContainer [2025-02-08 05:46:16,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:46:16,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:46:16,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:46:16,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:46:16,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:46:15" (1/3) ... [2025-02-08 05:46:16,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13063ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:16, skipping insertion in model container [2025-02-08 05:46:16,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:46:15" (2/3) ... [2025-02-08 05:46:16,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13063ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:46:16, skipping insertion in model container [2025-02-08 05:46:16,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:16" (3/3) ... [2025-02-08 05:46:16,479 INFO L128 eAbstractionObserver]: Analyzing ICFG value-barrier-race.i [2025-02-08 05:46:16,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:46:16,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG value-barrier-race.i that has 2 procedures, 88 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 05:46:16,496 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:46:16,555 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:46:16,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 92 transitions, 191 flow [2025-02-08 05:46:16,657 INFO L124 PetriNetUnfolderBase]: 4/136 cut-off events. [2025-02-08 05:46:16,659 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:46:16,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 136 events. 4/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 232 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 3 conditions per place. [2025-02-08 05:46:16,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 92 transitions, 191 flow [2025-02-08 05:46:16,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 92 transitions, 191 flow [2025-02-08 05:46:16,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:16,685 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;@9c9b3a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:16,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-08 05:46:16,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:16,699 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-02-08 05:46:16,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:16,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:16,700 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] [2025-02-08 05:46:16,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:16,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 789701506, now seen corresponding path program 1 times [2025-02-08 05:46:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:16,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734357454] [2025-02-08 05:46:16,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:16,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:46:16,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:46:16,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:16,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:16,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:16,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734357454] [2025-02-08 05:46:16,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734357454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:16,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445899137] [2025-02-08 05:46:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:16,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:16,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 92 [2025-02-08 05:46:16,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-02-08 05:46:16,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:16,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 92 [2025-02-08 05:46:16,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:17,070 INFO L124 PetriNetUnfolderBase]: 7/171 cut-off events. [2025-02-08 05:46:17,073 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:46:17,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 171 events. 7/171 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 432 event pairs, 3 based on Foata normal form. 7/156 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2025-02-08 05:46:17,077 INFO L140 encePairwiseOnDemand]: 85/92 looper letters, 9 selfloop transitions, 4 changer transitions 1/93 dead transitions. [2025-02-08 05:46:17,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 219 flow [2025-02-08 05:46:17,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-02-08 05:46:17,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9311594202898551 [2025-02-08 05:46:17,094 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 191 flow. Second operand 3 states and 257 transitions. [2025-02-08 05:46:17,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 219 flow [2025-02-08 05:46:17,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:17,107 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 215 flow [2025-02-08 05:46:17,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-02-08 05:46:17,115 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2025-02-08 05:46:17,116 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 215 flow [2025-02-08 05:46:17,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-02-08 05:46:17,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:17,117 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-02-08 05:46:17,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:46:17,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:17,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1811353832, now seen corresponding path program 1 times [2025-02-08 05:46:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978273542] [2025-02-08 05:46:17,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:17,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:46:17,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:46:17,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:17,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:17,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:17,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978273542] [2025-02-08 05:46:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978273542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:17,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738902875] [2025-02-08 05:46:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:17,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:17,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:17,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:17,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:17,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 92 [2025-02-08 05:46:17,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:17,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:17,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 92 [2025-02-08 05:46:17,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:17,923 INFO L124 PetriNetUnfolderBase]: 5/154 cut-off events. [2025-02-08 05:46:17,924 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:46:17,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 154 events. 5/154 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 366 event pairs, 1 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 119. Up to 21 conditions per place. [2025-02-08 05:46:17,925 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 14 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2025-02-08 05:46:17,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 251 flow [2025-02-08 05:46:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 440 transitions. [2025-02-08 05:46:17,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2025-02-08 05:46:17,928 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 215 flow. Second operand 6 states and 440 transitions. [2025-02-08 05:46:17,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 251 flow [2025-02-08 05:46:17,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 91 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:17,930 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 215 flow [2025-02-08 05:46:17,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-02-08 05:46:17,931 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-02-08 05:46:17,931 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 215 flow [2025-02-08 05:46:17,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:17,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:17,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:46:17,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:17,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2029903812, now seen corresponding path program 1 times [2025-02-08 05:46:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:17,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062056245] [2025-02-08 05:46:17,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:46:17,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:46:17,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:17,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:17,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:17,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062056245] [2025-02-08 05:46:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062056245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191229399] [2025-02-08 05:46:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:17,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:17,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:17,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:17,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 92 [2025-02-08 05:46:17,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:17,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:17,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 92 [2025-02-08 05:46:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:18,040 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2025-02-08 05:46:18,044 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:46:18,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 228 events. 8/228 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 711 event pairs, 1 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 187. Up to 11 conditions per place. [2025-02-08 05:46:18,046 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 7 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-02-08 05:46:18,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 246 flow [2025-02-08 05:46:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-02-08 05:46:18,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528985507246377 [2025-02-08 05:46:18,048 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 215 flow. Second operand 3 states and 263 transitions. [2025-02-08 05:46:18,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 246 flow [2025-02-08 05:46:18,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:18,054 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 231 flow [2025-02-08 05:46:18,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2025-02-08 05:46:18,055 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 4 predicate places. [2025-02-08 05:46:18,055 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 231 flow [2025-02-08 05:46:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:18,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:18,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:18,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:46:18,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1852169715, now seen corresponding path program 1 times [2025-02-08 05:46:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104775278] [2025-02-08 05:46:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:18,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:46:18,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:46:18,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:18,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:18,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104775278] [2025-02-08 05:46:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104775278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:18,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:18,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331195617] [2025-02-08 05:46:18,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:18,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:18,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:18,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:18,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:18,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 92 [2025-02-08 05:46:18,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-02-08 05:46:18,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:18,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 92 [2025-02-08 05:46:18,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:18,146 INFO L124 PetriNetUnfolderBase]: 25/292 cut-off events. [2025-02-08 05:46:18,148 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2025-02-08 05:46:18,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 292 events. 25/292 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1105 event pairs, 3 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 309. Up to 44 conditions per place. [2025-02-08 05:46:18,152 INFO L140 encePairwiseOnDemand]: 87/92 looper letters, 10 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2025-02-08 05:46:18,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 277 flow [2025-02-08 05:46:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-02-08 05:46:18,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9202898550724637 [2025-02-08 05:46:18,154 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 231 flow. Second operand 3 states and 254 transitions. [2025-02-08 05:46:18,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 277 flow [2025-02-08 05:46:18,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 98 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:18,157 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 271 flow [2025-02-08 05:46:18,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2025-02-08 05:46:18,157 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-02-08 05:46:18,158 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 271 flow [2025-02-08 05:46:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-02-08 05:46:18,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:18,158 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] [2025-02-08 05:46:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:46:18,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:18,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 275222214, now seen corresponding path program 1 times [2025-02-08 05:46:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355369288] [2025-02-08 05:46:18,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:18,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:46:18,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:46:18,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355369288] [2025-02-08 05:46:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355369288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141278135] [2025-02-08 05:46:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:18,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:18,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:18,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:18,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 92 [2025-02-08 05:46:18,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 98 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:18,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:18,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 92 [2025-02-08 05:46:18,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:18,287 INFO L124 PetriNetUnfolderBase]: 19/332 cut-off events. [2025-02-08 05:46:18,289 INFO L125 PetriNetUnfolderBase]: For 75/87 co-relation queries the response was YES. [2025-02-08 05:46:18,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 332 events. 19/332 cut-off events. For 75/87 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1389 event pairs, 0 based on Foata normal form. 3/305 useless extension candidates. Maximal degree in co-relation 345. Up to 26 conditions per place. [2025-02-08 05:46:18,293 INFO L140 encePairwiseOnDemand]: 88/92 looper letters, 6 selfloop transitions, 4 changer transitions 0/101 dead transitions. [2025-02-08 05:46:18,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 302 flow [2025-02-08 05:46:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-02-08 05:46:18,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9492753623188406 [2025-02-08 05:46:18,295 INFO L175 Difference]: Start difference. First operand has 97 places, 98 transitions, 271 flow. Second operand 3 states and 262 transitions. [2025-02-08 05:46:18,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 302 flow [2025-02-08 05:46:18,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:18,300 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 287 flow [2025-02-08 05:46:18,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-02-08 05:46:18,301 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-02-08 05:46:18,301 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 287 flow [2025-02-08 05:46:18,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:46:18,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:18,301 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-02-08 05:46:18,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:46:18,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:18,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1386377890, now seen corresponding path program 1 times [2025-02-08 05:46:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122960548] [2025-02-08 05:46:18,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:18,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:46:18,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:46:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:18,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122960548] [2025-02-08 05:46:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122960548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672045732] [2025-02-08 05:46:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:18,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:46:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:18,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:46:18,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:46:18,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 92 [2025-02-08 05:46:18,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 287 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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-02-08 05:46:18,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:18,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 92 [2025-02-08 05:46:18,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:18,590 INFO L124 PetriNetUnfolderBase]: 19/338 cut-off events. [2025-02-08 05:46:18,590 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2025-02-08 05:46:18,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 338 events. 19/338 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1426 event pairs, 0 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2025-02-08 05:46:18,592 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 11 selfloop transitions, 2 changer transitions 5/105 dead transitions. [2025-02-08 05:46:18,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 333 flow [2025-02-08 05:46:18,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-02-08 05:46:18,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8713768115942029 [2025-02-08 05:46:18,594 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 287 flow. Second operand 6 states and 481 transitions. [2025-02-08 05:46:18,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 333 flow [2025-02-08 05:46:18,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:18,598 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 297 flow [2025-02-08 05:46:18,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2025-02-08 05:46:18,599 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 15 predicate places. [2025-02-08 05:46:18,599 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 297 flow [2025-02-08 05:46:18,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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-02-08 05:46:18,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:18,600 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:18,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:46:18,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-02-08 05:46:18,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:18,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1537139268, now seen corresponding path program 1 times [2025-02-08 05:46:18,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:18,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414773904] [2025-02-08 05:46:18,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:18,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:46:18,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:46:18,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:18,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:18,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:46:18,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:46:18,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:18,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:18,676 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:18,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-02-08 05:46:18,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-02-08 05:46:18,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-02-08 05:46:18,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-02-08 05:46:18,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-02-08 05:46:18,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-02-08 05:46:18,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-02-08 05:46:18,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-02-08 05:46:18,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-02-08 05:46:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:46:18,680 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:18,683 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:46:18,683 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:46:18,699 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:46:18,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 107 transitions, 230 flow [2025-02-08 05:46:18,723 INFO L124 PetriNetUnfolderBase]: 8/226 cut-off events. [2025-02-08 05:46:18,724 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:46:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 226 events. 8/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 138. Up to 6 conditions per place. [2025-02-08 05:46:18,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 107 transitions, 230 flow [2025-02-08 05:46:18,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 107 transitions, 230 flow [2025-02-08 05:46:18,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:46:18,728 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;@9c9b3a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:46:18,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-08 05:46:18,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:46:18,731 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-02-08 05:46:18,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:46:18,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:18,732 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] [2025-02-08 05:46:18,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:18,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash 112121538, now seen corresponding path program 1 times [2025-02-08 05:46:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504712402] [2025-02-08 05:46:18,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:18,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:46:18,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:46:18,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:18,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504712402] [2025-02-08 05:46:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504712402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326278118] [2025-02-08 05:46:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:18,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:18,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-02-08 05:46:18,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-02-08 05:46:18,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:18,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-02-08 05:46:18,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:18,854 INFO L124 PetriNetUnfolderBase]: 43/436 cut-off events. [2025-02-08 05:46:18,855 INFO L125 PetriNetUnfolderBase]: For 33/40 co-relation queries the response was YES. [2025-02-08 05:46:18,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 436 events. 43/436 cut-off events. For 33/40 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1893 event pairs, 23 based on Foata normal form. 40/411 useless extension candidates. Maximal degree in co-relation 309. Up to 83 conditions per place. [2025-02-08 05:46:18,861 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 12 selfloop transitions, 5 changer transitions 1/108 dead transitions. [2025-02-08 05:46:18,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 108 transitions, 266 flow [2025-02-08 05:46:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2025-02-08 05:46:18,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9221183800623053 [2025-02-08 05:46:18,864 INFO L175 Difference]: Start difference. First operand has 105 places, 107 transitions, 230 flow. Second operand 3 states and 296 transitions. [2025-02-08 05:46:18,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 108 transitions, 266 flow [2025-02-08 05:46:18,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:46:18,866 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 260 flow [2025-02-08 05:46:18,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-02-08 05:46:18,869 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2025-02-08 05:46:18,870 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 260 flow [2025-02-08 05:46:18,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-02-08 05:46:18,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:18,870 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-02-08 05:46:18,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:46:18,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:18,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:18,871 INFO L85 PathProgramCache]: Analyzing trace with hash -802930296, now seen corresponding path program 1 times [2025-02-08 05:46:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551567513] [2025-02-08 05:46:18,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:18,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:18,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:46:18,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:46:18,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:18,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:19,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551567513] [2025-02-08 05:46:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551567513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:19,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754886961] [2025-02-08 05:46:19,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:46:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:19,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:46:19,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:46:19,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 107 [2025-02-08 05:46:19,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 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-02-08 05:46:19,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:19,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 107 [2025-02-08 05:46:19,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:19,305 INFO L124 PetriNetUnfolderBase]: 28/353 cut-off events. [2025-02-08 05:46:19,305 INFO L125 PetriNetUnfolderBase]: For 40/45 co-relation queries the response was YES. [2025-02-08 05:46:19,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 353 events. 28/353 cut-off events. For 40/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1327 event pairs, 9 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 273. Up to 45 conditions per place. [2025-02-08 05:46:19,308 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 16 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-02-08 05:46:19,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 300 flow [2025-02-08 05:46:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-02-08 05:46:19,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006230529595015 [2025-02-08 05:46:19,313 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 260 flow. Second operand 6 states and 514 transitions. [2025-02-08 05:46:19,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 300 flow [2025-02-08 05:46:19,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 106 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:19,318 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 258 flow [2025-02-08 05:46:19,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2025-02-08 05:46:19,319 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 5 predicate places. [2025-02-08 05:46:19,320 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 258 flow [2025-02-08 05:46:19,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 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-02-08 05:46:19,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:19,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:19,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:46:19,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1172427665, now seen corresponding path program 1 times [2025-02-08 05:46:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73830790] [2025-02-08 05:46:19,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:19,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:46:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:46:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:19,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73830790] [2025-02-08 05:46:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73830790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:19,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:19,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709344693] [2025-02-08 05:46:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:19,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:19,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:19,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-02-08 05:46:19,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-02-08 05:46:19,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:19,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-02-08 05:46:19,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:19,476 INFO L124 PetriNetUnfolderBase]: 102/1044 cut-off events. [2025-02-08 05:46:19,476 INFO L125 PetriNetUnfolderBase]: For 93/114 co-relation queries the response was YES. [2025-02-08 05:46:19,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1044 events. 102/1044 cut-off events. For 93/114 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7262 event pairs, 25 based on Foata normal form. 4/885 useless extension candidates. Maximal degree in co-relation 613. Up to 93 conditions per place. [2025-02-08 05:46:19,483 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 14 selfloop transitions, 5 changer transitions 0/114 dead transitions. [2025-02-08 05:46:19,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 323 flow [2025-02-08 05:46:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-02-08 05:46:19,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2025-02-08 05:46:19,485 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 258 flow. Second operand 3 states and 300 transitions. [2025-02-08 05:46:19,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 323 flow [2025-02-08 05:46:19,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 313 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:19,487 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 292 flow [2025-02-08 05:46:19,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2025-02-08 05:46:19,488 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 4 predicate places. [2025-02-08 05:46:19,488 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 292 flow [2025-02-08 05:46:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-02-08 05:46:19,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:19,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:46:19,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1585708717, now seen corresponding path program 1 times [2025-02-08 05:46:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196647196] [2025-02-08 05:46:19,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:19,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:46:19,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:46:19,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:19,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196647196] [2025-02-08 05:46:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196647196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026187275] [2025-02-08 05:46:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:19,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:19,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:19,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:19,532 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2025-02-08 05:46:19,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-02-08 05:46:19,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:19,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2025-02-08 05:46:19,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:19,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][102], [30#L1022-1true, 106#true, 124#true, 104#true, 63#L1034-1true, Black: 119#true, 121#(= |#race~ready~0| 0), 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:19,620 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,620 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,620 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,620 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][111], [72#L1022-2true, 106#true, 124#true, 104#true, 63#L1034-1true, Black: 119#true, 121#(= |#race~ready~0| 0), 23#L1022-1true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:19,633 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,633 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,633 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,633 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][55], [30#L1022-1true, 106#true, 124#true, 90#L1035-5true, 104#true, Black: 119#true, 81#L1022-2true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:19,640 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,640 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,640 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,640 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][86], [72#L1022-2true, 106#true, 124#true, 90#L1035-5true, 104#true, Black: 119#true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 23#L1022-1true]) [2025-02-08 05:46:19,649 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,649 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,649 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,649 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][55], [30#L1022-1true, 106#true, 124#true, 104#true, Black: 119#true, 121#(= |#race~ready~0| 0), 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 55#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:19,692 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-02-08 05:46:19,692 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-08 05:46:19,692 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-08 05:46:19,692 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-02-08 05:46:19,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][86], [72#L1022-2true, 106#true, 124#true, 104#true, Black: 119#true, 121#(= |#race~ready~0| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 23#L1022-1true, 55#ULTIMATE.startFINALtrue]) [2025-02-08 05:46:19,695 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-02-08 05:46:19,695 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-08 05:46:19,695 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-02-08 05:46:19,696 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-02-08 05:46:19,730 INFO L124 PetriNetUnfolderBase]: 298/1564 cut-off events. [2025-02-08 05:46:19,731 INFO L125 PetriNetUnfolderBase]: For 473/508 co-relation queries the response was YES. [2025-02-08 05:46:19,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 1564 events. 298/1564 cut-off events. For 473/508 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 11472 event pairs, 48 based on Foata normal form. 8/1307 useless extension candidates. Maximal degree in co-relation 1971. Up to 348 conditions per place. [2025-02-08 05:46:19,747 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 14 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2025-02-08 05:46:19,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 117 transitions, 360 flow [2025-02-08 05:46:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2025-02-08 05:46:19,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9065420560747663 [2025-02-08 05:46:19,749 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 292 flow. Second operand 3 states and 291 transitions. [2025-02-08 05:46:19,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 117 transitions, 360 flow [2025-02-08 05:46:19,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:19,755 INFO L231 Difference]: Finished difference. Result has 111 places, 117 transitions, 348 flow [2025-02-08 05:46:19,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=111, PETRI_TRANSITIONS=117} [2025-02-08 05:46:19,757 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2025-02-08 05:46:19,757 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 117 transitions, 348 flow [2025-02-08 05:46:19,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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-02-08 05:46:19,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:19,758 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] [2025-02-08 05:46:19,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:46:19,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:19,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1118252866, now seen corresponding path program 1 times [2025-02-08 05:46:19,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:19,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315025846] [2025-02-08 05:46:19,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:19,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:46:19,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:46:19,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:19,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:46:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315025846] [2025-02-08 05:46:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315025846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:19,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:46:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015992002] [2025-02-08 05:46:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:19,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:19,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:19,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:19,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 107 [2025-02-08 05:46:19,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 117 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-02-08 05:46:19,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:19,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 107 [2025-02-08 05:46:19,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:19,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][104], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 30#L1022-1true, 106#true, 124#true, 104#true, 63#L1034-1true, 129#true, Black: 119#true, 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:19,908 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,908 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,908 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,908 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][119], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 72#L1022-2true, 106#true, 124#true, 104#true, 63#L1034-1true, Black: 119#true, 129#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 23#L1022-1true]) [2025-02-08 05:46:19,909 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,909 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,910 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:19,910 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:19,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][55], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 30#L1022-1true, 106#true, 124#true, 90#L1035-5true, 104#true, Black: 119#true, 129#true, 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:19,919 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,919 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,919 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,919 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][85], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 72#L1022-2true, 106#true, 124#true, 90#L1035-5true, 104#true, Black: 119#true, 129#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 23#L1022-1true]) [2025-02-08 05:46:19,961 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,961 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:19,961 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:19,961 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,093 INFO L124 PetriNetUnfolderBase]: 382/2576 cut-off events. [2025-02-08 05:46:20,093 INFO L125 PetriNetUnfolderBase]: For 863/1158 co-relation queries the response was YES. [2025-02-08 05:46:20,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 2576 events. 382/2576 cut-off events. For 863/1158 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 23499 event pairs, 42 based on Foata normal form. 25/2272 useless extension candidates. Maximal degree in co-relation 2510. Up to 353 conditions per place. [2025-02-08 05:46:20,111 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 16 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2025-02-08 05:46:20,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 127 transitions, 435 flow [2025-02-08 05:46:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-02-08 05:46:20,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345794392523364 [2025-02-08 05:46:20,112 INFO L175 Difference]: Start difference. First operand has 111 places, 117 transitions, 348 flow. Second operand 3 states and 300 transitions. [2025-02-08 05:46:20,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 127 transitions, 435 flow [2025-02-08 05:46:20,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:20,118 INFO L231 Difference]: Finished difference. Result has 113 places, 124 transitions, 402 flow [2025-02-08 05:46:20,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=113, PETRI_TRANSITIONS=124} [2025-02-08 05:46:20,119 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 8 predicate places. [2025-02-08 05:46:20,119 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 124 transitions, 402 flow [2025-02-08 05:46:20,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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-02-08 05:46:20,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:20,120 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-02-08 05:46:20,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:46:20,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1973993705, now seen corresponding path program 1 times [2025-02-08 05:46:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438232413] [2025-02-08 05:46:20,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:20,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:46:20,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:46:20,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:20,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:46:20,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:20,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438232413] [2025-02-08 05:46:20,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438232413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:20,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:46:20,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326257952] [2025-02-08 05:46:20,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:20,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:46:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:20,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:46:20,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:46:20,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2025-02-08 05:46:20,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 124 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-02-08 05:46:20,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:20,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2025-02-08 05:46:20,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:20,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][100], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 30#L1022-1true, 106#true, Black: 131#(= |#race~data~0| 0), 104#true, 63#L1034-1true, 134#true, 129#true, Black: 119#true, 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:20,385 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,385 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,385 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,385 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][123], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 72#L1022-2true, 106#true, Black: 131#(= |#race~data~0| 0), 104#true, 63#L1034-1true, 134#true, 129#true, Black: 119#true, 23#L1022-1true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:20,386 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,386 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,386 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,386 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][55], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 30#L1022-1true, 106#true, Black: 131#(= |#race~data~0| 0), 90#L1035-5true, 104#true, 134#true, 129#true, Black: 119#true, 81#L1022-2true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|)]) [2025-02-08 05:46:20,395 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,395 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,395 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,395 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][78], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 72#L1022-2true, 106#true, Black: 131#(= |#race~data~0| 0), 90#L1035-5true, 104#true, 134#true, 129#true, Black: 119#true, Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), 23#L1022-1true]) [2025-02-08 05:46:20,407 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,407 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,407 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,407 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,558 INFO L124 PetriNetUnfolderBase]: 363/2559 cut-off events. [2025-02-08 05:46:20,558 INFO L125 PetriNetUnfolderBase]: For 784/1001 co-relation queries the response was YES. [2025-02-08 05:46:20,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 2559 events. 363/2559 cut-off events. For 784/1001 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 23565 event pairs, 33 based on Foata normal form. 1/2310 useless extension candidates. Maximal degree in co-relation 3398. Up to 329 conditions per place. [2025-02-08 05:46:20,579 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 14 selfloop transitions, 2 changer transitions 5/130 dead transitions. [2025-02-08 05:46:20,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 130 transitions, 456 flow [2025-02-08 05:46:20,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:46:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:46:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 556 transitions. [2025-02-08 05:46:20,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8660436137071651 [2025-02-08 05:46:20,582 INFO L175 Difference]: Start difference. First operand has 113 places, 124 transitions, 402 flow. Second operand 6 states and 556 transitions. [2025-02-08 05:46:20,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 130 transitions, 456 flow [2025-02-08 05:46:20,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:46:20,586 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 410 flow [2025-02-08 05:46:20,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2025-02-08 05:46:20,588 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 15 predicate places. [2025-02-08 05:46:20,588 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 410 flow [2025-02-08 05:46:20,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-02-08 05:46:20,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:20,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:20,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:46:20,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:20,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1396562797, now seen corresponding path program 1 times [2025-02-08 05:46:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-02-08 05:46:20,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:20,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:46:20,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:46:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:20,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:46:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:46:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:46:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45589607] [2025-02-08 05:46:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45589607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:46:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:46:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:46:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171761447] [2025-02-08 05:46:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:46:20,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:46:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:46:20,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:46:20,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:46:20,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 107 [2025-02-08 05:46:20,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-02-08 05:46:20,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:46:20,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 107 [2025-02-08 05:46:20,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:46:20,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][78], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 30#L1022-1true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 63#L1034-1true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 81#L1022-2true, Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, Black: 119#true]) [2025-02-08 05:46:20,762 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,762 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,762 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,762 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][101], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 72#L1022-2true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 63#L1034-1true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, Black: 119#true, 23#L1022-1true]) [2025-02-08 05:46:20,764 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,764 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-02-08 05:46:20,764 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,764 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-02-08 05:46:20,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([290] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][39], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 30#L1022-1true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), 81#L1022-2true, Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, 90#L1035-5true, Black: 119#true]) [2025-02-08 05:46:20,772 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,772 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,772 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,772 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([303] L1022-->L1022-2: Formula: (= |v_#race~ready~0_6| 0) InVars {} OutVars{#race~ready~0=|v_#race~ready~0_6|} AuxVars[] AssignedVars[#race~ready~0][58], [Black: 126#(= |#race~ready~0| |ULTIMATE.start_main_#t~nondet11#1|), 72#L1022-2true, Black: 131#(= |#race~data~0| 0), 145#true, 104#true, 134#true, Black: 136#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 140#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 137#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 110#(= |#race~data~0| |ULTIMATE.start_main_#t~nondet10#1|), Black: 138#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 106#true, 90#L1035-5true, Black: 119#true, 23#L1022-1true]) [2025-02-08 05:46:20,780 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,780 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-08 05:46:20,780 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,780 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-02-08 05:46:20,861 INFO L124 PetriNetUnfolderBase]: 217/1432 cut-off events. [2025-02-08 05:46:20,861 INFO L125 PetriNetUnfolderBase]: For 356/474 co-relation queries the response was YES. [2025-02-08 05:46:20,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 1432 events. 217/1432 cut-off events. For 356/474 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11166 event pairs, 34 based on Foata normal form. 9/1331 useless extension candidates. Maximal degree in co-relation 2338. Up to 214 conditions per place. [2025-02-08 05:46:20,872 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 6 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-02-08 05:46:20,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 368 flow [2025-02-08 05:46:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:46:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:46:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2025-02-08 05:46:20,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283489096573209 [2025-02-08 05:46:20,874 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 410 flow. Second operand 3 states and 298 transitions. [2025-02-08 05:46:20,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 368 flow [2025-02-08 05:46:20,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 346 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 05:46:20,881 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 340 flow [2025-02-08 05:46:20,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-02-08 05:46:20,882 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2025-02-08 05:46:20,882 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 340 flow [2025-02-08 05:46:20,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-02-08 05:46:20,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:46:20,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:46:20,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-02-08 05:46:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:46:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1491670665, now seen corresponding path program 1 times [2025-02-08 05:46:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:46:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134291215] [2025-02-08 05:46:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:46:20,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:46:20,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:46:20,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:46:20,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:20,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:20,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:46:20,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:46:20,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:46:20,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:46:20,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:46:20,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:46:20,919 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-02-08 05:46:20,919 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-02-08 05:46:20,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:46:20,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:46:20,968 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-02-08 05:46:20,968 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:46:20,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:46:20 BasicIcfg [2025-02-08 05:46:20,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:46:20,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:46:20,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:46:20,974 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:46:20,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:46:16" (3/4) ... [2025-02-08 05:46:20,984 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:46:21,041 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-02-08 05:46:21,086 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:46:21,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:46:21,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:46:21,090 INFO L158 Benchmark]: Toolchain (without parser) took 5717.95ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 111.0MB in the beginning and 236.8MB in the end (delta: -125.8MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-02-08 05:46:21,091 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:46:21,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.42ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 83.7MB in the end (delta: 26.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:46:21,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.27ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:46:21,093 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 80.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:46:21,093 INFO L158 Benchmark]: IcfgBuilder took 427.93ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 65.4MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:46:21,093 INFO L158 Benchmark]: TraceAbstraction took 4502.23ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 65.1MB in the beginning and 53.3MB in the end (delta: 11.7MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2025-02-08 05:46:21,094 INFO L158 Benchmark]: Witness Printer took 114.19ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 53.3MB in the beginning and 236.8MB in the end (delta: -183.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:46:21,095 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.55ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.42ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 83.7MB in the end (delta: 26.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.27ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 80.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 427.93ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 65.4MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4502.23ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 65.1MB in the beginning and 53.3MB in the end (delta: 11.7MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 114.19ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 53.3MB in the beginning and 236.8MB in the end (delta: -183.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1022]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 _Bool ready = 0; VAL [ready=0] [L1020] 0 int data = 0; VAL [data=0, ready=0] [L1027] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, ready=0, threads_total=1] [L1028] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, ready=0] [L1028] RET 0 assume_abort_if_not(threads_total >= 0) [L1029] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, ready=0, threads_total=1, tids={-2:0}] [L1030] 0 int i = 0; VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1030] COND TRUE 0 i < threads_total VAL [data=0, ready=0] [L1031] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1031] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, i=0, ready=0, threads_total=1, tids={-2:0}] [L1022] COND TRUE 1 !ready [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0] [L1030] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, i=1, ready=0, threads_total=1, tids={-2:0}] [L1030] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0] [L1033] 0 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=0, threads_total=1, tids={-2:0}] [L1034] 0 ready = 1 VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1, threads_total=1, tids={-2:0}] [L1022] 1 !ready VAL [\old(arg)={0:0}, arg={0:0}, data=0, ready=1] Now there is a data race on ~ready~0 between C: ready = 1 [1034] and C: !ready [1022] - UnprovableResult [Line: 1033]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1031]: 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: 1023]: 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, 101 locations, 9 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: 2.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 211 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 12 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=6, InterpolantAutomatonStates: 24, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 113 locations, 11 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: 2.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 17 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=6, InterpolantAutomatonStates: 27, 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.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2/2 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-02-08 05:46:21,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)