./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:12:53,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:12:53,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:12:53,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:12:53,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:12:53,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:12:53,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:12:53,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:12:53,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:12:53,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:12:53,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:12:53,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:12:53,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:12:53,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:12:53,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:12:53,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:12:53,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:12:53,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac [2025-03-08 22:12:54,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:12:54,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:12:54,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:12:54,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:12:54,271 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:12:54,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2025-03-08 22:12:55,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4e93071/bf7d2d1e62c54ce9857de7797b799b3f/FLAGce40773fc [2025-03-08 22:12:55,772 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:12:55,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2025-03-08 22:12:55,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4e93071/bf7d2d1e62c54ce9857de7797b799b3f/FLAGce40773fc [2025-03-08 22:12:56,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b4e93071/bf7d2d1e62c54ce9857de7797b799b3f [2025-03-08 22:12:56,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:12:56,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:12:56,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:12:56,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:12:56,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:12:56,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4fe8d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56, skipping insertion in model container [2025-03-08 22:12:56,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:12:56,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:12:56,269 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:12:56,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:12:56,332 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:12:56,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56 WrapperNode [2025-03-08 22:12:56,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:12:56,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:12:56,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:12:56,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:12:56,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,358 INFO L138 Inliner]: procedures = 159, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2025-03-08 22:12:56,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:12:56,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:12:56,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:12:56,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:12:56,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:12:56,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:12:56,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:12:56,373 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:12:56,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (1/1) ... [2025-03-08 22:12:56,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:12:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:12:56,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:12:56,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:12:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:12:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:12:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:12:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-08 22:12:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-08 22:12:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:12:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:12:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:12:56,426 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:12:56,522 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:12:56,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:12:56,689 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:12:56,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:12:56,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:12:56,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:12:56,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:12:56 BoogieIcfgContainer [2025-03-08 22:12:56,711 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:12:56,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:12:56,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:12:56,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:12:56,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:12:56" (1/3) ... [2025-03-08 22:12:56,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d99f28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:12:56, skipping insertion in model container [2025-03-08 22:12:56,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:12:56" (2/3) ... [2025-03-08 22:12:56,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d99f28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:12:56, skipping insertion in model container [2025-03-08 22:12:56,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:12:56" (3/3) ... [2025-03-08 22:12:56,718 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i [2025-03-08 22:12:56,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:12:56,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race.i that has 2 procedures, 91 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-08 22:12:56,733 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:12:56,780 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 22:12:56,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 94 transitions, 192 flow [2025-03-08 22:12:56,864 INFO L124 PetriNetUnfolderBase]: 5/125 cut-off events. [2025-03-08 22:12:56,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:12:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 125 events. 5/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2025-03-08 22:12:56,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 94 transitions, 192 flow [2025-03-08 22:12:56,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 192 flow [2025-03-08 22:12:56,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:12:56,894 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;@519ab74e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:12:56,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 22:12:56,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:12:56,907 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2025-03-08 22:12:56,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:12:56,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:56,908 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] [2025-03-08 22:12:56,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 22:12:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1193709122, now seen corresponding path program 1 times [2025-03-08 22:12:56,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:56,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391131198] [2025-03-08 22:12:56,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:56,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:12:57,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:12:57,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:57,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-03-08 22:12:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391131198] [2025-03-08 22:12:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391131198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:57,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:57,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259828366] [2025-03-08 22:12:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:57,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:57,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:57,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:57,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 94 [2025-03-08 22:12:57,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:57,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 94 [2025-03-08 22:12:57,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:57,246 INFO L124 PetriNetUnfolderBase]: 32/293 cut-off events. [2025-03-08 22:12:57,247 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:12:57,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 293 events. 32/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1195 event pairs, 7 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 310. Up to 59 conditions per place. [2025-03-08 22:12:57,256 INFO L140 encePairwiseOnDemand]: 81/94 looper letters, 16 selfloop transitions, 8 changer transitions 1/102 dead transitions. [2025-03-08 22:12:57,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 256 flow [2025-03-08 22:12:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2025-03-08 22:12:57,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2025-03-08 22:12:57,269 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 192 flow. Second operand 3 states and 264 transitions. [2025-03-08 22:12:57,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 256 flow [2025-03-08 22:12:57,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 102 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:12:57,281 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 256 flow [2025-03-08 22:12:57,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2025-03-08 22:12:57,286 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2025-03-08 22:12:57,286 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 256 flow [2025-03-08 22:12:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:57,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:12:57,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 22:12:57,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1165884949, now seen corresponding path program 1 times [2025-03-08 22:12:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687304457] [2025-03-08 22:12:57,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:57,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:12:57,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:12:57,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:57,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:57,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687304457] [2025-03-08 22:12:57,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687304457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:57,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:57,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940251932] [2025-03-08 22:12:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:57,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:57,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:57,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:57,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:57,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 94 [2025-03-08 22:12:57,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:57,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 94 [2025-03-08 22:12:57,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:57,426 INFO L124 PetriNetUnfolderBase]: 27/308 cut-off events. [2025-03-08 22:12:57,426 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:12:57,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 308 events. 27/308 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1397 event pairs, 5 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 359. Up to 45 conditions per place. [2025-03-08 22:12:57,428 INFO L140 encePairwiseOnDemand]: 90/94 looper letters, 8 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2025-03-08 22:12:57,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 286 flow [2025-03-08 22:12:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-03-08 22:12:57,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468085106382979 [2025-03-08 22:12:57,430 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 256 flow. Second operand 3 states and 267 transitions. [2025-03-08 22:12:57,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 286 flow [2025-03-08 22:12:57,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:57,432 INFO L231 Difference]: Finished difference. Result has 99 places, 101 transitions, 262 flow [2025-03-08 22:12:57,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=99, PETRI_TRANSITIONS=101} [2025-03-08 22:12:57,433 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-03-08 22:12:57,433 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 101 transitions, 262 flow [2025-03-08 22:12:57,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:57,433 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] [2025-03-08 22:12:57,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:12:57,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 22:12:57,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash 121946364, now seen corresponding path program 1 times [2025-03-08 22:12:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978202216] [2025-03-08 22:12:57,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:57,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:12:57,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:12:57,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:57,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:57,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978202216] [2025-03-08 22:12:57,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978202216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:57,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:57,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:57,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854602252] [2025-03-08 22:12:57,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:57,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:57,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:57,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 94 [2025-03-08 22:12:57,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 101 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:57,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 94 [2025-03-08 22:12:57,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:57,586 INFO L124 PetriNetUnfolderBase]: 54/456 cut-off events. [2025-03-08 22:12:57,586 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2025-03-08 22:12:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 456 events. 54/456 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2526 event pairs, 23 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 627. Up to 104 conditions per place. [2025-03-08 22:12:57,588 INFO L140 encePairwiseOnDemand]: 88/94 looper letters, 19 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2025-03-08 22:12:57,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 334 flow [2025-03-08 22:12:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:57,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:57,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2025-03-08 22:12:57,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2025-03-08 22:12:57,591 INFO L175 Difference]: Start difference. First operand has 99 places, 101 transitions, 262 flow. Second operand 3 states and 255 transitions. [2025-03-08 22:12:57,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 334 flow [2025-03-08 22:12:57,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:57,596 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 312 flow [2025-03-08 22:12:57,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-03-08 22:12:57,597 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2025-03-08 22:12:57,597 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 312 flow [2025-03-08 22:12:57,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:57,598 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] [2025-03-08 22:12:57,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:12:57,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 22:12:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1385728704, now seen corresponding path program 1 times [2025-03-08 22:12:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139161146] [2025-03-08 22:12:57,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:57,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:12:57,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:12:57,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:57,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139161146] [2025-03-08 22:12:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139161146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:57,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:57,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24190306] [2025-03-08 22:12:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:57,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:57,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:57,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:57,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 94 [2025-03-08 22:12:57,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:57,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 94 [2025-03-08 22:12:57,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:57,704 INFO L124 PetriNetUnfolderBase]: 36/366 cut-off events. [2025-03-08 22:12:57,704 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2025-03-08 22:12:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 366 events. 36/366 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1962 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 495. Up to 51 conditions per place. [2025-03-08 22:12:57,706 INFO L140 encePairwiseOnDemand]: 89/94 looper letters, 8 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2025-03-08 22:12:57,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 346 flow [2025-03-08 22:12:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-08 22:12:57,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2025-03-08 22:12:57,708 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 312 flow. Second operand 3 states and 262 transitions. [2025-03-08 22:12:57,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 346 flow [2025-03-08 22:12:57,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:57,713 INFO L231 Difference]: Finished difference. Result has 103 places, 109 transitions, 334 flow [2025-03-08 22:12:57,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=109} [2025-03-08 22:12:57,715 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2025-03-08 22:12:57,715 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 334 flow [2025-03-08 22:12:57,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:57,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:57,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:12:57,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 22:12:57,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1939137931, now seen corresponding path program 1 times [2025-03-08 22:12:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134603963] [2025-03-08 22:12:57,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:57,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:12:57,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:12:57,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134603963] [2025-03-08 22:12:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134603963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908040520] [2025-03-08 22:12:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:57,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:57,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:57,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:57,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:57,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 94 [2025-03-08 22:12:57,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 109 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:57,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 94 [2025-03-08 22:12:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:57,871 INFO L124 PetriNetUnfolderBase]: 64/479 cut-off events. [2025-03-08 22:12:57,871 INFO L125 PetriNetUnfolderBase]: For 157/165 co-relation queries the response was YES. [2025-03-08 22:12:57,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 479 events. 64/479 cut-off events. For 157/165 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2712 event pairs, 13 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 796. Up to 109 conditions per place. [2025-03-08 22:12:57,875 INFO L140 encePairwiseOnDemand]: 87/94 looper letters, 16 selfloop transitions, 11 changer transitions 1/116 dead transitions. [2025-03-08 22:12:57,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 416 flow [2025-03-08 22:12:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2025-03-08 22:12:57,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9148936170212766 [2025-03-08 22:12:57,877 INFO L175 Difference]: Start difference. First operand has 103 places, 109 transitions, 334 flow. Second operand 3 states and 258 transitions. [2025-03-08 22:12:57,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 416 flow [2025-03-08 22:12:57,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 116 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:57,882 INFO L231 Difference]: Finished difference. Result has 105 places, 115 transitions, 408 flow [2025-03-08 22:12:57,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=105, PETRI_TRANSITIONS=115} [2025-03-08 22:12:57,883 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2025-03-08 22:12:57,883 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 408 flow [2025-03-08 22:12:57,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:57,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:57,885 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:57,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:12:57,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-08 22:12:57,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash -475650103, now seen corresponding path program 1 times [2025-03-08 22:12:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118634384] [2025-03-08 22:12:57,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:57,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:12:57,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:12:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:12:57,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:12:57,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:12:57,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:12:57,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:57,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:12:57,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:12:57,949 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:12:57,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-08 22:12:57,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-08 22:12:57,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-08 22:12:57,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:12:57,954 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 22:12:57,956 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:12:57,957 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:12:57,981 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 22:12:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 122 transitions, 254 flow [2025-03-08 22:12:58,001 INFO L124 PetriNetUnfolderBase]: 7/192 cut-off events. [2025-03-08 22:12:58,001 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 22:12:58,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 192 events. 7/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 318 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 126. Up to 6 conditions per place. [2025-03-08 22:12:58,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 122 transitions, 254 flow [2025-03-08 22:12:58,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 122 transitions, 254 flow [2025-03-08 22:12:58,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:12:58,004 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;@519ab74e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:12:58,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-08 22:12:58,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:12:58,010 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2025-03-08 22:12:58,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:12:58,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:58,010 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] [2025-03-08 22:12:58,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:12:58,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:58,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1875767420, now seen corresponding path program 1 times [2025-03-08 22:12:58,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:58,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374144780] [2025-03-08 22:12:58,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:58,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 22:12:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 22:12:58,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:58,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374144780] [2025-03-08 22:12:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374144780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6515099] [2025-03-08 22:12:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:58,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:58,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:58,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:58,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:58,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2025-03-08 22:12:58,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 122 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:58,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:58,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2025-03-08 22:12:58,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:58,278 INFO L124 PetriNetUnfolderBase]: 563/2345 cut-off events. [2025-03-08 22:12:58,278 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-08 22:12:58,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 2345 events. 563/2345 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 19540 event pairs, 195 based on Foata normal form. 1/2089 useless extension candidates. Maximal degree in co-relation 2679. Up to 666 conditions per place. [2025-03-08 22:12:58,292 INFO L140 encePairwiseOnDemand]: 105/122 looper letters, 26 selfloop transitions, 11 changer transitions 1/136 dead transitions. [2025-03-08 22:12:58,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 136 transitions, 361 flow [2025-03-08 22:12:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2025-03-08 22:12:58,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9316939890710383 [2025-03-08 22:12:58,294 INFO L175 Difference]: Start difference. First operand has 124 places, 122 transitions, 254 flow. Second operand 3 states and 341 transitions. [2025-03-08 22:12:58,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 136 transitions, 361 flow [2025-03-08 22:12:58,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:12:58,296 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 344 flow [2025-03-08 22:12:58,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2025-03-08 22:12:58,298 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2025-03-08 22:12:58,298 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 344 flow [2025-03-08 22:12:58,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:58,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:58,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:58,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:12:58,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:12:58,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:58,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1609366107, now seen corresponding path program 1 times [2025-03-08 22:12:58,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:58,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607445907] [2025-03-08 22:12:58,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:58,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:58,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 22:12:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 22:12:58,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:58,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607445907] [2025-03-08 22:12:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607445907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440307877] [2025-03-08 22:12:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:58,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:58,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 122 [2025-03-08 22:12:58,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:58,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:58,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 122 [2025-03-08 22:12:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:58,589 INFO L124 PetriNetUnfolderBase]: 499/2655 cut-off events. [2025-03-08 22:12:58,590 INFO L125 PetriNetUnfolderBase]: For 238/248 co-relation queries the response was YES. [2025-03-08 22:12:58,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 2655 events. 499/2655 cut-off events. For 238/248 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 24723 event pairs, 157 based on Foata normal form. 0/2367 useless extension candidates. Maximal degree in co-relation 3206. Up to 510 conditions per place. [2025-03-08 22:12:58,601 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 14 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2025-03-08 22:12:58,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 394 flow [2025-03-08 22:12:58,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-03-08 22:12:58,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9453551912568307 [2025-03-08 22:12:58,603 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 344 flow. Second operand 3 states and 346 transitions. [2025-03-08 22:12:58,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 394 flow [2025-03-08 22:12:58,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:58,607 INFO L231 Difference]: Finished difference. Result has 129 places, 133 transitions, 352 flow [2025-03-08 22:12:58,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=129, PETRI_TRANSITIONS=133} [2025-03-08 22:12:58,608 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 5 predicate places. [2025-03-08 22:12:58,608 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 133 transitions, 352 flow [2025-03-08 22:12:58,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:58,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:58,608 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] [2025-03-08 22:12:58,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:12:58,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:12:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -741067524, now seen corresponding path program 1 times [2025-03-08 22:12:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628016305] [2025-03-08 22:12:58,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:58,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 22:12:58,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 22:12:58,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:58,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628016305] [2025-03-08 22:12:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628016305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617532462] [2025-03-08 22:12:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:58,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:58,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:58,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:58,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:58,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 122 [2025-03-08 22:12:58,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 133 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:58,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:58,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 122 [2025-03-08 22:12:58,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:58,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [75#L692-7true, 132#true, Black: 127#true, Black: 134#(= |#race~data~0| 0), 137#true, 123#true, 102#L689true, 46#L704-2true, 125#true]) [2025-03-08 22:12:58,759 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-03-08 22:12:58,759 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-08 22:12:58,759 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-08 22:12:58,759 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-03-08 22:12:58,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [75#L692-7true, 132#true, Black: 127#true, 104#L691true, 137#true, Black: 134#(= |#race~data~0| 0), 123#true, 46#L704-2true, 125#true]) [2025-03-08 22:12:58,870 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-03-08 22:12:58,870 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-08 22:12:58,870 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-08 22:12:58,870 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-08 22:12:59,061 INFO L124 PetriNetUnfolderBase]: 1078/4632 cut-off events. [2025-03-08 22:12:59,061 INFO L125 PetriNetUnfolderBase]: For 832/973 co-relation queries the response was YES. [2025-03-08 22:12:59,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7774 conditions, 4632 events. 1078/4632 cut-off events. For 832/973 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 46216 event pairs, 540 based on Foata normal form. 39/4073 useless extension candidates. Maximal degree in co-relation 6529. Up to 1374 conditions per place. [2025-03-08 22:12:59,082 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 28 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2025-03-08 22:12:59,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 147 transitions, 476 flow [2025-03-08 22:12:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2025-03-08 22:12:59,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098360655737705 [2025-03-08 22:12:59,084 INFO L175 Difference]: Start difference. First operand has 129 places, 133 transitions, 352 flow. Second operand 3 states and 333 transitions. [2025-03-08 22:12:59,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 147 transitions, 476 flow [2025-03-08 22:12:59,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 147 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:59,087 INFO L231 Difference]: Finished difference. Result has 131 places, 143 transitions, 450 flow [2025-03-08 22:12:59,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=131, PETRI_TRANSITIONS=143} [2025-03-08 22:12:59,088 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2025-03-08 22:12:59,088 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 143 transitions, 450 flow [2025-03-08 22:12:59,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:59,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:59,088 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] [2025-03-08 22:12:59,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:12:59,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:12:59,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 435130757, now seen corresponding path program 1 times [2025-03-08 22:12:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301059120] [2025-03-08 22:12:59,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:59,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 22:12:59,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 22:12:59,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:59,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:59,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:59,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301059120] [2025-03-08 22:12:59,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301059120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:59,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:59,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090729627] [2025-03-08 22:12:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:59,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:59,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:59,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:59,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 122 [2025-03-08 22:12:59,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 143 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:59,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:59,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 122 [2025-03-08 22:12:59,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:59,379 INFO L124 PetriNetUnfolderBase]: 734/3783 cut-off events. [2025-03-08 22:12:59,380 INFO L125 PetriNetUnfolderBase]: For 968/1202 co-relation queries the response was YES. [2025-03-08 22:12:59,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6443 conditions, 3783 events. 734/3783 cut-off events. For 968/1202 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 38896 event pairs, 217 based on Foata normal form. 3/3313 useless extension candidates. Maximal degree in co-relation 4267. Up to 663 conditions per place. [2025-03-08 22:12:59,403 INFO L140 encePairwiseOnDemand]: 116/122 looper letters, 16 selfloop transitions, 7 changer transitions 0/151 dead transitions. [2025-03-08 22:12:59,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 523 flow [2025-03-08 22:12:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:12:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:12:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-03-08 22:12:59,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2025-03-08 22:12:59,406 INFO L175 Difference]: Start difference. First operand has 131 places, 143 transitions, 450 flow. Second operand 3 states and 342 transitions. [2025-03-08 22:12:59,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 151 transitions, 523 flow [2025-03-08 22:12:59,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:12:59,412 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 482 flow [2025-03-08 22:12:59,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2025-03-08 22:12:59,413 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2025-03-08 22:12:59,413 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 482 flow [2025-03-08 22:12:59,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:59,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:12:59,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:12:59,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:12:59,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:12:59,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:12:59,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1835242166, now seen corresponding path program 1 times [2025-03-08 22:12:59,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:12:59,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972718799] [2025-03-08 22:12:59,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:12:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:12:59,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 22:12:59,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 22:12:59,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:12:59,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:12:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:12:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:12:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972718799] [2025-03-08 22:12:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972718799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:12:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:12:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:12:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573122823] [2025-03-08 22:12:59,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:12:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:12:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:12:59,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:12:59,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:12:59,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 122 [2025-03-08 22:12:59,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:12:59,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:12:59,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 122 [2025-03-08 22:12:59,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:12:59,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, Black: 134#(= |#race~data~0| 0), 102#L689true, 123#true, 46#L704-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2025-03-08 22:12:59,578 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-03-08 22:12:59,578 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-08 22:12:59,578 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-03-08 22:12:59,578 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-03-08 22:12:59,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 104#L691true, Black: 134#(= |#race~data~0| 0), 123#true, 46#L704-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2025-03-08 22:12:59,698 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-03-08 22:12:59,698 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-08 22:12:59,698 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-08 22:12:59,698 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-08 22:12:59,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][121], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, Black: 134#(= |#race~data~0| 0), 96#L692-7true, 123#true, 46#L704-2true, 36#L692-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 142#true, 125#true]) [2025-03-08 22:12:59,814 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-08 22:12:59,814 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:12:59,814 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:12:59,814 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:12:59,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][36], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 96#L692-7true, Black: 134#(= |#race~data~0| 0), 123#true, 46#L704-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 52#L693true, 142#true, 125#true]) [2025-03-08 22:12:59,873 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-08 22:12:59,873 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:12:59,873 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-08 22:12:59,874 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:12:59,961 INFO L124 PetriNetUnfolderBase]: 1587/6317 cut-off events. [2025-03-08 22:12:59,961 INFO L125 PetriNetUnfolderBase]: For 3311/3591 co-relation queries the response was YES. [2025-03-08 22:12:59,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 6317 events. 1587/6317 cut-off events. For 3311/3591 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 66647 event pairs, 516 based on Foata normal form. 46/5552 useless extension candidates. Maximal degree in co-relation 10314. Up to 1835 conditions per place. [2025-03-08 22:13:00,000 INFO L140 encePairwiseOnDemand]: 113/122 looper letters, 31 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2025-03-08 22:13:00,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 166 transitions, 667 flow [2025-03-08 22:13:00,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:13:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:13:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2025-03-08 22:13:00,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207650273224044 [2025-03-08 22:13:00,002 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 482 flow. Second operand 3 states and 337 transitions. [2025-03-08 22:13:00,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 166 transitions, 667 flow [2025-03-08 22:13:00,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:13:00,007 INFO L231 Difference]: Finished difference. Result has 135 places, 163 transitions, 650 flow [2025-03-08 22:13:00,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=135, PETRI_TRANSITIONS=163} [2025-03-08 22:13:00,008 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2025-03-08 22:13:00,008 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 163 transitions, 650 flow [2025-03-08 22:13:00,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:00,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:00,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:00,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:13:00,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:13:00,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1567660690, now seen corresponding path program 1 times [2025-03-08 22:13:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:00,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119829290] [2025-03-08 22:13:00,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:00,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:00,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:13:00,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:13:00,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:00,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:13:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:13:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:13:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119829290] [2025-03-08 22:13:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119829290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:13:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:13:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:13:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553318396] [2025-03-08 22:13:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:13:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:13:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:13:00,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:13:00,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:13:00,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 122 [2025-03-08 22:13:00,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 163 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:00,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:13:00,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 122 [2025-03-08 22:13:00,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:13:00,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L699-3-->L699-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_5| |v_#race~threads_alive~0_6|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|, #race~threads_alive~0=|v_#race~threads_alive~0_6|} AuxVars[] AssignedVars[#race~threads_alive~0][129], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 129#(= |#race~threads_alive~0| 0), 147#true, 83#L699-1true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 96#L692-7true, Black: 134#(= |#race~data~0| 0), 123#true, 36#L692-2true, 152#true, Black: 137#true, 125#true]) [2025-03-08 22:13:00,581 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2025-03-08 22:13:00,581 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-08 22:13:00,581 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-08 22:13:00,581 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-03-08 22:13:00,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][126], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 96#L692-7true, Black: 134#(= |#race~data~0| 0), 123#true, 46#L704-2true, 36#L692-2true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2025-03-08 22:13:00,590 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,590 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,590 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,590 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,614 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][126], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 96#L692-7true, 123#true, 46#L704-2true, 36#L692-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 125#true]) [2025-03-08 22:13:00,614 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,614 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,614 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,614 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,614 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][126], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 41#L692-6true, Black: 134#(= |#race~data~0| 0), 123#true, 46#L704-2true, 36#L692-2true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2025-03-08 22:13:00,617 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][126], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 96#L692-7true, 123#true, 46#L704-2true, 36#L692-2true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2025-03-08 22:13:00,617 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,617 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][75], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 96#L692-7true, 123#true, 46#L704-2true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 121#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 125#true]) [2025-03-08 22:13:00,646 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,646 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,646 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-08 22:13:00,646 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-08 22:13:00,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][75], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 96#L692-7true, Black: 134#(= |#race~data~0| 0), 123#true, 46#L704-2true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 52#L693true, 125#true]) [2025-03-08 22:13:00,735 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-08 22:13:00,735 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-08 22:13:00,735 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,736 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,737 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([296] L704-->L704-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][75], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 96#L692-7true, 123#true, 46#L704-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 52#L693true, 125#true]) [2025-03-08 22:13:00,737 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-03-08 22:13:00,737 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-08 22:13:00,737 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-03-08 22:13:00,738 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,738 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-03-08 22:13:00,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([337] L692-3-->L692-1: Formula: (= |v_#race~threads_alive~0_12| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_12|} AuxVars[] AssignedVars[#race~threads_alive~0][84], [60#L700true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 129#(= |#race~threads_alive~0| 0), 99#L692-1true, Black: 147#true, Black: 134#(= |#race~data~0| 0), 96#L692-7true, 123#true, 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2025-03-08 22:13:00,783 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2025-03-08 22:13:00,783 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-08 22:13:00,783 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-08 22:13:00,783 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2025-03-08 22:13:00,846 INFO L124 PetriNetUnfolderBase]: 2086/8262 cut-off events. [2025-03-08 22:13:00,846 INFO L125 PetriNetUnfolderBase]: For 5315/5980 co-relation queries the response was YES. [2025-03-08 22:13:00,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16924 conditions, 8262 events. 2086/8262 cut-off events. For 5315/5980 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 94130 event pairs, 561 based on Foata normal form. 54/7285 useless extension candidates. Maximal degree in co-relation 10153. Up to 1525 conditions per place. [2025-03-08 22:13:00,889 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 23 selfloop transitions, 9 changer transitions 1/180 dead transitions. [2025-03-08 22:13:00,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 180 transitions, 750 flow [2025-03-08 22:13:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:13:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:13:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2025-03-08 22:13:00,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9002732240437158 [2025-03-08 22:13:00,891 INFO L175 Difference]: Start difference. First operand has 135 places, 163 transitions, 650 flow. Second operand 6 states and 659 transitions. [2025-03-08 22:13:00,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 180 transitions, 750 flow [2025-03-08 22:13:00,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 180 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:13:00,906 INFO L231 Difference]: Finished difference. Result has 140 places, 170 transitions, 663 flow [2025-03-08 22:13:00,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=140, PETRI_TRANSITIONS=170} [2025-03-08 22:13:00,907 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 16 predicate places. [2025-03-08 22:13:00,907 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 170 transitions, 663 flow [2025-03-08 22:13:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:13:00,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:13:00,907 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:00,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:13:00,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-08 22:13:00,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:13:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -221198836, now seen corresponding path program 1 times [2025-03-08 22:13:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:13:00,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277514118] [2025-03-08 22:13:00,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:13:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:13:00,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:13:00,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:13:00,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:00,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:13:00,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:13:00,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 22:13:00,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 22:13:00,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:13:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:13:00,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:13:00,930 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-08 22:13:00,930 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-08 22:13:00,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-08 22:13:00,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-08 22:13:00,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-08 22:13:00,931 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-08 22:13:00,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:13:00,931 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:13:00,969 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-08 22:13:00,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:13:00,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:13:00 BasicIcfg [2025-03-08 22:13:00,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:13:00,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:13:00,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:13:00,977 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:13:00,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:12:56" (3/4) ... [2025-03-08 22:13:00,978 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 22:13:01,025 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-08 22:13:01,062 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:13:01,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:13:01,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:13:01,065 INFO L158 Benchmark]: Toolchain (without parser) took 5031.57ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 111.3MB in the beginning and 132.2MB in the end (delta: -20.9MB). Peak memory consumption was 210.0MB. Max. memory is 16.1GB. [2025-03-08 22:13:01,065 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:13:01,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.80ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.9MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:13:01,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.97ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:13:01,066 INFO L158 Benchmark]: Boogie Preprocessor took 14.23ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.4MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:13:01,066 INFO L158 Benchmark]: IcfgBuilder took 337.49ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 75.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:13:01,066 INFO L158 Benchmark]: TraceAbstraction took 4263.02ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 144.5MB in the end (delta: -70.3MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. [2025-03-08 22:13:01,066 INFO L158 Benchmark]: Witness Printer took 86.14ms. Allocated memory is still 377.5MB. Free memory was 144.5MB in the beginning and 132.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:13:01,067 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.80ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.9MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.97ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.23ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.4MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 337.49ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 75.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4263.02ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 144.5MB in the end (delta: -70.3MB). Peak memory consumption was 168.1MB. Max. memory is 16.1GB. * Witness Printer took 86.14ms. Allocated memory is still 377.5MB. Free memory was 144.5MB in the beginning and 132.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 int data = 0; VAL [data=0, threads_alive=0] [L687] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L696] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L697] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L697] RET 0 assume_abort_if_not(threads_total >= 0) [L698] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L699] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L700] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L701] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L698] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L690] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [699] and C: threads_alive-- [692] - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: 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: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: 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, 120 locations, 122 edges, 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: 1.1s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 34 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=5, InterpolantAutomatonStates: 15, 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.2s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, 148 locations, 150 edges, 14 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.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 37 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=6, InterpolantAutomatonStates: 21, 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.2s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 22:13:01,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)